Base | Representation |
---|---|
bin | 10100100110100001… |
… | …101110000011110101 |
3 | 2010002122221220110211 |
4 | 110212201232003311 |
5 | 330301012210401 |
6 | 14055022145421 |
7 | 1412120116624 |
oct | 244641560365 |
9 | 63078856424 |
10 | 22121210101 |
11 | 9421934621 |
12 | 4354422271 |
13 | 2116cb0943 |
14 | 10dbcd36bb |
15 | 8970c2951 |
hex | 52686e0f5 |
22121210101 has 8 divisors (see below), whose sum is σ = 23491966680. Its totient is φ = 20758176768.
The previous prime is 22121210081. The next prime is 22121210131. The reversal of 22121210101 is 10101212122.
It can be written as a sum of positive squares in 4 ways, for example, as 4218502500 + 17902707601 = 64950^2 + 133801^2 .
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 22121210101 - 227 = 21986992373 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22121210131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1924906 + ... + 1936363.
It is an arithmetic number, because the mean of its divisors is an integer number (2936495835).
Almost surely, 222121210101 is an apocalyptic number.
It is an amenable number.
22121210101 is a deficient number, since it is larger than the sum of its proper divisors (1370756579).
22121210101 is a wasteful number, since it uses less digits than its factorization.
22121210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3861623.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 22121210101 its reverse (10101212122), we get a palindrome (32222422223).
The spelling of 22121210101 in words is "twenty-two billion, one hundred twenty-one million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •