Base | Representation |
---|---|
bin | 1010111011101101101101… |
… | …1100001101110011111000 |
3 | 1120120012022011110202212010 |
4 | 2232323123130031303320 |
5 | 3033423002011213422 |
6 | 41322212103045520 |
7 | 2350326405641052 |
oct | 256733334156370 |
9 | 46505264422763 |
10 | 12021000101112 |
11 | 3915094196672 |
12 | 14219007408a0 |
13 | 69276333b712 |
14 | 2d7b68a3a8d2 |
15 | 15ca6188cb0c |
hex | aeedb70dcf8 |
12021000101112 has 32 divisors (see below), whose sum is σ = 31634210793600. Its totient is φ = 3796105294944.
The previous prime is 12021000101111. The next prime is 12021000101129. The reversal of 12021000101112 is 21110100012021.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12021000101111) 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, 13180920708 + ... + 13180921619.
It is an arithmetic number, because the mean of its divisors is an integer number (988569087300).
Almost surely, 212021000101112 is an apocalyptic number.
12021000101112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12021000101112 is an abundant number, since it is smaller than the sum of its proper divisors (19613210692488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12021000101112 is a wasteful number, since it uses less digits than its factorization.
12021000101112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26361842355 (or 26361842351 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 12021000101112 its reverse (21110100012021), we get a palindrome (33131100113133).
The spelling of 12021000101112 in words is "twelve trillion, twenty-one billion, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •