Base | Representation |
---|---|
bin | 110010100001101111100010… |
… | …111111000100001111100100 |
3 | 1002010211010120000022201010110 |
4 | 302201233202333010033210 |
5 | 213111332324001023022 |
6 | 2104342550153253020 |
7 | 64543642353305562 |
oct | 6241574277041744 |
9 | 1063733500281113 |
10 | 222221121111012 |
11 | 648964a2635711 |
12 | 20b0bb37a04170 |
13 | 96cc491b6376a |
14 | 3cc37b9970a32 |
15 | 1aa573474900c |
hex | ca1be2fc43e4 |
222221121111012 has 48 divisors (see below), whose sum is σ = 519251505776640. Its totient is φ = 73968642013728.
The previous prime is 222221121110977. The next prime is 222221121111019. The reversal of 222221121111012 is 210111121122222.
It is a self number, because there is not a number n which added to its sum of digits gives 222221121111012.
It is not an unprimeable number, because it can be changed into a prime (222221121111019) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 122883189 + ... + 124678467.
It is an arithmetic number, because the mean of its divisors is an integer number (10817739703680).
Almost surely, 2222221121111012 is an apocalyptic number.
It is an amenable number.
222221121111012 is an abundant number, since it is smaller than the sum of its proper divisors (297030384665628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
222221121111012 is a wasteful number, since it uses less digits than its factorization.
222221121111012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1809912 (or 1809910 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 21.
Adding to 222221121111012 its reverse (210111121122222), we get a palindrome (432332242233234).
The spelling of 222221121111012 in words is "two hundred twenty-two trillion, two hundred twenty-one billion, one hundred twenty-one million, one hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •