Base | Representation |
---|---|
bin | 1010000110110011011110… |
… | …0001110010111011111101 |
3 | 1110100022001012222220012211 |
4 | 2201230313201302323331 |
5 | 2424024400033013041 |
6 | 35344442101300421 |
7 | 2224550005401061 |
oct | 241546741627375 |
9 | 43308035886184 |
10 | 11112012001021 |
11 | 35a463a0a3188 |
12 | 12b56ba404711 |
13 | 627b2070a8b9 |
14 | 2a5b77a59aa1 |
15 | 1440b0235481 |
hex | a1b37872efd |
11112012001021 has 8 divisors (see below), whose sum is σ = 11182098244320. Its totient is φ = 11041949104272.
The previous prime is 11112012001007. The next prime is 11112012001037. The reversal of 11112012001021 is 12010021021111.
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 11112012001021 - 211 = 11112011998973 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11112012000992 and 11112012001010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11112012001001) 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, 4881226 + ... + 6786043.
It is an arithmetic number, because the mean of its divisors is an integer number (1397762280540).
Almost surely, 211112012001021 is an apocalyptic number.
It is an amenable number.
11112012001021 is a deficient number, since it is larger than the sum of its proper divisors (70086243299).
11112012001021 is a wasteful number, since it uses less digits than its factorization.
11112012001021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11673275.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11112012001021 its reverse (12010021021111), we get a palindrome (23122033022132).
The spelling of 11112012001021 in words is "eleven trillion, one hundred twelve billion, twelve million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •