Base | Representation |
---|---|
bin | 1010111011001100100100… |
… | …0000110110001101111111 |
3 | 1120112100022222020200222211 |
4 | 2232303021000312031333 |
5 | 3033301240324031421 |
6 | 41314141044321251 |
7 | 2346563026564030 |
oct | 256631100661577 |
9 | 46470288220884 |
10 | 12012101002111 |
11 | 39113379518a1 |
12 | 14200383a3227 |
13 | 691975759072 |
14 | 2d7562baca87 |
15 | 15c6e04929e1 |
hex | aecc903637f |
12012101002111 has 8 divisors (see below), whose sum is σ = 13804808814720. Its totient is φ = 10238566535448.
The previous prime is 12012101002093. The next prime is 12012101002117. The reversal of 12012101002111 is 11120010121021.
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 12012101002111 - 25 = 12012101002079 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12012101002091 and 12012101002100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12012101002117) 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, 4793335141 + ... + 4793337646.
It is an arithmetic number, because the mean of its divisors is an integer number (1725601101840).
Almost surely, 212012101002111 is an apocalyptic number.
12012101002111 is a deficient number, since it is larger than the sum of its proper divisors (1792707812609).
12012101002111 is an equidigital number, since it uses as much as digits as its factorization.
12012101002111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9586672973.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12012101002111 its reverse (11120010121021), we get a palindrome (23132111123132).
The spelling of 12012101002111 in words is "twelve trillion, twelve billion, one hundred one million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •