Base | Representation |
---|---|
bin | 1010111011001001001101… |
… | …1011011011110011000000 |
3 | 1120112021000022121202211120 |
4 | 2232302103123123303000 |
5 | 3033242420203031422 |
6 | 41313511531512240 |
7 | 2346531532321545 |
oct | 256622333336300 |
9 | 46467008552746 |
10 | 12011202002112 |
11 | 3910a16442895 |
12 | 141ba272b8680 |
13 | 6918614228c1 |
14 | 2d74b9632bcc |
15 | 15c68b5b245c |
hex | aec936dbcc0 |
12011202002112 has 56 divisors (see below), whose sum is σ = 31879890018096. Its totient is φ = 3991103904768.
The previous prime is 12011202002099. The next prime is 12011202002119. The reversal of 12011202002112 is 21120020211021.
It is a junction number, because it is equal to n+sod(n) for n = 12011202002091 and 12011202002100.
It is not an unprimeable number, because it can be changed into a prime (12011202002119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 98611603 + ... + 98733330.
Almost surely, 212011202002112 is an apocalyptic number.
12011202002112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12011202002112 is an abundant number, since it is smaller than the sum of its proper divisors (19868688015984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12011202002112 is a wasteful number, since it uses less digits than its factorization.
12011202002112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197345265 (or 197345255 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 12011202002112 its reverse (21120020211021), we get a palindrome (33131222213133).
The spelling of 12011202002112 in words is "twelve trillion, eleven billion, two hundred two million, two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •