Base | Representation |
---|---|
bin | 1010111011001000111010… |
… | …0011000101010010101001 |
3 | 1120112020210121112210001211 |
4 | 2232302032203011102221 |
5 | 3033242233222333001 |
6 | 41313455444513121 |
7 | 2346526516332241 |
oct | 256621643052251 |
9 | 46466717483054 |
10 | 12011120121001 |
11 | 39109841a7351 |
12 | 141ba039ab7a1 |
13 | 69184a484241 |
14 | 2d74ac7dab21 |
15 | 15c6842db351 |
hex | aec8e8c54a9 |
12011120121001 has 8 divisors (see below), whose sum is σ = 12491931260864. Its totient is φ = 11539467288720.
The previous prime is 12011120120999. The next prime is 12011120121017. The reversal of 12011120121001 is 10012102111021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12011120121001 - 21 = 12011120120999 is a prime.
It is a super-2 number, since 2×120111201210012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12011120121041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2289574221 + ... + 2289579466.
It is an arithmetic number, because the mean of its divisors is an integer number (1561491407608).
Almost surely, 212011120121001 is an apocalyptic number.
It is an amenable number.
12011120121001 is a deficient number, since it is larger than the sum of its proper divisors (480811139863).
12011120121001 is an equidigital number, since it uses as much as digits as its factorization.
12011120121001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4579153791.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12011120121001 its reverse (10012102111021), we get a palindrome (22023222232022).
The spelling of 12011120121001 in words is "twelve trillion, eleven billion, one hundred twenty million, one hundred twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •