Base | Representation |
---|---|
bin | 1010000011110011110011… |
… | …00000110100010000110011 |
3 | 2220022202110220101001100201 |
4 | 11001321321200310100303 |
5 | 10344413023234021321 |
6 | 115014145145500031 |
7 | 4442124660302335 |
oct | 501717140642063 |
9 | 86282426331321 |
10 | 22121120220211 |
11 | 7059572738a71 |
12 | 259327a4a1617 |
13 | c46021b4285c |
14 | 56694cb37455 |
15 | 28564b346291 |
hex | 141e79834433 |
22121120220211 has 4 divisors (see below), whose sum is σ = 22131116209872. Its totient is φ = 22111124230552.
The previous prime is 22121120220197. The next prime is 22121120220229. The reversal of 22121120220211 is 11202202112122.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 22121120220211 - 29 = 22121120219699 is a prime.
It is a super-2 number, since 2×221211202202112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22121120220281) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4997991511 + ... + 4997995936.
It is an arithmetic number, because the mean of its divisors is an integer number (5532779052468).
Almost surely, 222121120220211 is an apocalyptic number.
22121120220211 is a deficient number, since it is larger than the sum of its proper divisors (9995989661).
22121120220211 is an equidigital number, since it uses as much as digits as its factorization.
22121120220211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9995989660.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 22121120220211 its reverse (11202202112122), we get a palindrome (33323322332333).
The spelling of 22121120220211 in words is "twenty-two trillion, one hundred twenty-one billion, one hundred twenty million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •