Base | Representation |
---|---|
bin | 1010111010100011101000… |
… | …0001001101010010001111 |
3 | 1120111021222010112120121111 |
4 | 2232220322001031102033 |
5 | 3033111234134120421 |
6 | 41305122412312451 |
7 | 2346023513020444 |
oct | 256507201152217 |
9 | 46437863476544 |
10 | 12001112020111 |
11 | 3907708959a95 |
12 | 1419a90172727 |
13 | 690913bbb756 |
14 | 2d6bdd5699cb |
15 | 15c29a87cee1 |
hex | aea3a04d48f |
12001112020111 has 8 divisors (see below), whose sum is σ = 12309018422400. Its totient is φ = 11693929253760.
The previous prime is 12001112020067. The next prime is 12001112020169. The reversal of 12001112020111 is 11102021110021.
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 12001112020111 - 227 = 12000977802383 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12001112020091 and 12001112020100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12001112020171) 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, 180875391 + ... + 180941728.
It is an arithmetic number, because the mean of its divisors is an integer number (1538627302800).
Almost surely, 212001112020111 is an apocalyptic number.
12001112020111 is a deficient number, since it is larger than the sum of its proper divisors (307906402289).
12001112020111 is an equidigital number, since it uses as much as digits as its factorization.
12001112020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 361817969.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12001112020111 its reverse (11102021110021), we get a palindrome (23103133130132).
The spelling of 12001112020111 in words is "twelve trillion, one billion, one hundred twelve million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •