Base | Representation |
---|---|
bin | 1100000100010… |
… | …10101011000101 |
3 | 21001111002020110 |
4 | 12002022223011 |
5 | 201403400201 |
6 | 14013423233 |
7 | 2336310663 |
oct | 602125305 |
9 | 231432213 |
10 | 101231301 |
11 | 52162636 |
12 | 29a9ab19 |
13 | 17c850a2 |
14 | d631c33 |
15 | 8d496d6 |
hex | 608aac5 |
101231301 has 4 divisors (see below), whose sum is σ = 134975072. Its totient is φ = 67487532.
The previous prime is 101231293. The next prime is 101231321. The reversal of 101231301 is 103132101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 103132101 = 3 ⋅34377367.
It is not a de Polignac number, because 101231301 - 23 = 101231293 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101231321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16871881 + ... + 16871886.
It is an arithmetic number, because the mean of its divisors is an integer number (33743768).
Almost surely, 2101231301 is an apocalyptic number.
It is an amenable number.
101231301 is a deficient number, since it is larger than the sum of its proper divisors (33743771).
101231301 is an equidigital number, since it uses as much as digits as its factorization.
101231301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33743770.
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 101231301 is about 10061.3766950651. The cubic root of 101231301 is about 466.0561817115.
Adding to 101231301 its reverse (103132101), we get a palindrome (204363402).
The spelling of 101231301 in words is "one hundred one million, two hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •