Base | Representation |
---|---|
bin | 1010000011110101100111… |
… | …11011001110100100000011 |
3 | 2220022212000012102022101002 |
4 | 11001322303323032210003 |
5 | 10344422030124102321 |
6 | 115014430314402215 |
7 | 4442161160213123 |
oct | 501726373164403 |
9 | 86285005368332 |
10 | 22122100222211 |
11 | 7059a25942a80 |
12 | 25934b273036b |
13 | c46149b9a4b2 |
14 | 566a02d5ac83 |
15 | 2856a73c720b |
hex | 141eb3ece903 |
22122100222211 has 8 divisors (see below), whose sum is σ = 24133415461824. Its totient is φ = 20110820852520.
The previous prime is 22122100222127. The next prime is 22122100222319. The reversal of 22122100222211 is 11222200122122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22122100222211 - 214 = 22122100205827 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22122103222211) 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, 7669781 + ... + 10152326.
It is an arithmetic number, because the mean of its divisors is an integer number (3016676932728).
Almost surely, 222122100222211 is an apocalyptic number.
22122100222211 is a deficient number, since it is larger than the sum of its proper divisors (2011315239613).
22122100222211 is a wasteful number, since it uses less digits than its factorization.
22122100222211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17934961.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 22122100222211 its reverse (11222200122122), we get a palindrome (33344300344333).
The spelling of 22122100222211 in words is "twenty-two trillion, one hundred twenty-two billion, one hundred million, two hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •