Base | Representation |
---|---|
bin | 1001000110011011101001… |
… | …01111011011001011100110 |
3 | 2121212011000102000211001102 |
4 | 10203031310233123023212 |
5 | 10110340002033034342 |
6 | 110321252151000102 |
7 | 4133556151466633 |
oct | 443156457331346 |
9 | 77764012024042 |
10 | 20012211221222 |
11 | 6416149576300 |
12 | 22b2601069032 |
13 | b221b313121c |
14 | 4d284bd3d18a |
15 | 24a86be2a832 |
hex | 123374bdb2e6 |
20012211221222 has 24 divisors (see below), whose sum is σ = 34936242348168. Its totient is φ = 8561373782720.
The previous prime is 20012211221213. The next prime is 20012211221231. The reversal of 20012211221222 is 22212211221002.
It is an interprime number because it is at equal distance from previous prime (20012211221213) and next prime (20012211221231).
It is a junction number, because it is equal to n+sod(n) for n = 20012211221194 and 20012211221203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2432204348 + ... + 2432212575.
It is an arithmetic number, because the mean of its divisors is an integer number (1455676764507).
Almost surely, 220012211221222 is an apocalyptic number.
20012211221222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20012211221222 is a deficient number, since it is larger than the sum of its proper divisors (14924031126946).
20012211221222 is a wasteful number, since it uses less digits than its factorization.
20012211221222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4864416964 (or 4864416953 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 20012211221222 its reverse (22212211221002), we get a palindrome (42224422442224).
The spelling of 20012211221222 in words is "twenty trillion, twelve billion, two hundred eleven million, two hundred twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •