Base | Representation |
---|---|
bin | 1001100011100010010001… |
… | …01101111011100101011010 |
3 | 2202101202011100100202112121 |
4 | 10301301020231323211122 |
5 | 10223230441200341442 |
6 | 112404512121131454 |
7 | 4266036622122244 |
oct | 461611055734532 |
9 | 82352140322477 |
10 | 21012200012122 |
11 | 6771251135680 |
12 | 243437b329b8a |
13 | b95598ca3a57 |
14 | 528dd2aa9094 |
15 | 2668976ca967 |
hex | 131c48b7b95a |
21012200012122 has 8 divisors (see below), whose sum is σ = 34383600019872. Its totient is φ = 9551000005500.
The previous prime is 21012200012117. The next prime is 21012200012131. The reversal of 21012200012122 is 22121000221012.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 21012200012096 and 21012200012105.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 477550000254 + ... + 477550000297.
It is an arithmetic number, because the mean of its divisors is an integer number (4297950002484).
Almost surely, 221012200012122 is an apocalyptic number.
21012200012122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21012200012122 is a deficient number, since it is larger than the sum of its proper divisors (13371400007750).
21012200012122 is a wasteful number, since it uses less digits than its factorization.
21012200012122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 955100000564.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 21012200012122 its reverse (22121000221012), we get a palindrome (43133200233134).
The spelling of 21012200012122 in words is "twenty-one trillion, twelve billion, two hundred million, twelve thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •