Base | Representation |
---|---|
bin | 10010110100101111… |
… | …011101100110110101 |
3 | 1221011121211122210010 |
4 | 102310233131212311 |
5 | 312343311210401 |
6 | 13141345450433 |
7 | 1313606644146 |
oct | 226457354665 |
9 | 57147748703 |
10 | 20212210101 |
11 | 86322a1676 |
12 | 3b01040a19 |
13 | 1ba1648745 |
14 | d9a565acd |
15 | 7d46d7ed6 |
hex | 4b4bdd9b5 |
20212210101 has 8 divisors (see below), whose sum is σ = 27018894240. Its totient is φ = 13440166352.
The previous prime is 20212210099. The next prime is 20212210103. The reversal of 20212210101 is 10101221202.
It is an interprime number because it is at equal distance from previous prime (20212210099) and next prime (20212210103).
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 20212210101 - 21 = 20212210099 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20212210103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8658735 + ... + 8661068.
It is an arithmetic number, because the mean of its divisors is an integer number (3377361780).
Almost surely, 220212210101 is an apocalyptic number.
It is an amenable number.
20212210101 is a deficient number, since it is larger than the sum of its proper divisors (6806684139).
20212210101 is a wasteful number, since it uses less digits than its factorization.
20212210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17320195.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 20212210101 its reverse (10101221202), we get a palindrome (30313431303).
It can be divided in two parts, 2021 and 2210101, that added together give a palindrome (2212122).
The spelling of 20212210101 in words is "twenty billion, two hundred twelve million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •