Base | Representation |
---|---|
bin | 10010110100100111… |
… | …000111011011010101 |
3 | 1221011110201111102002 |
4 | 102310213013123111 |
5 | 312342231201401 |
6 | 13141230525045 |
7 | 1313552232143 |
oct | 226447073325 |
9 | 57143644362 |
10 | 20210022101 |
11 | 8631037805 |
12 | 3b00366785 |
13 | 1ba1060879 |
14 | d9a156593 |
15 | 7d4404a6b |
hex | 4b49c76d5 |
20210022101 has 8 divisors (see below), whose sum is σ = 20346700440. Its totient is φ = 20073572352.
The previous prime is 20210022067. The next prime is 20210022103. The reversal of 20210022101 is 10122001202.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 12628140625 + 7581881476 = 112375^2 + 87074^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 20210022101 - 26 = 20210022037 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 (20210022103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 122165 + ... + 235253.
It is an arithmetic number, because the mean of its divisors is an integer number (2543337555).
Almost surely, 220210022101 is an apocalyptic number.
It is an amenable number.
20210022101 is a deficient number, since it is larger than the sum of its proper divisors (136678339).
20210022101 is a wasteful number, since it uses less digits than its factorization.
20210022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114295.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 20210022101 its reverse (10122001202), we get a palindrome (30332023303).
The spelling of 20210022101 in words is "twenty billion, two hundred ten million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •