Base | Representation |
---|---|
bin | 10100100000000001… |
… | …001001111010001001 |
3 | 2002211001110222021010 |
4 | 110200001021322021 |
5 | 330040033310441 |
6 | 14040121434133 |
7 | 1406322666423 |
oct | 244001117211 |
9 | 62731428233 |
10 | 22012010121 |
11 | 937622a002 |
12 | 432393b949 |
13 | 20ca49877a |
14 | 10cb5c9813 |
15 | 88c702116 |
hex | 520049e89 |
22012010121 has 4 divisors (see below), whose sum is σ = 29349346832. Its totient is φ = 14674673412.
The previous prime is 22012010113. The next prime is 22012010129. The reversal of 22012010121 is 12101021022.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (22012010113) and next prime (22012010129).
It is not a de Polignac number, because 22012010121 - 23 = 22012010113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22012010097 and 22012010106.
It is not an unprimeable number, because it can be changed into a prime (22012010129) 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, 3668668351 + ... + 3668668356.
It is an arithmetic number, because the mean of its divisors is an integer number (7337336708).
Almost surely, 222012010121 is an apocalyptic number.
It is an amenable number.
22012010121 is a deficient number, since it is larger than the sum of its proper divisors (7337336711).
22012010121 is an equidigital number, since it uses as much as digits as its factorization.
22012010121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7337336710.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 22012010121 its reverse (12101021022), we get a palindrome (34113031143).
The spelling of 22012010121 in words is "twenty-two billion, twelve million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •