Base | Representation |
---|---|
bin | 10010101001010110… |
… | …011110110110010101 |
3 | 1220200022020212202120 |
4 | 102221112132312111 |
5 | 312000401042323 |
6 | 13110401530153 |
7 | 1306066434354 |
oct | 225126366625 |
9 | 56608225676 |
10 | 20021112213 |
11 | 8544439a33 |
12 | 3a69043959 |
13 | 1b70b8a37b |
14 | d7d01d99b |
15 | 7c2a3b5e3 |
hex | 4a959ed95 |
20021112213 has 16 divisors (see below), whose sum is σ = 27086996160. Its totient is φ = 13152343424.
The previous prime is 20021112187. The next prime is 20021112263. The reversal of 20021112213 is 31221112002.
It is a cyclic number.
It is not a de Polignac number, because 20021112213 - 213 = 20021104021 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20021112192 and 20021112201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20021112263) 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 15 ways as a sum of consecutive naturals, for example, 49731 + ... + 206192.
It is an arithmetic number, because the mean of its divisors is an integer number (1692937260).
Almost surely, 220021112213 is an apocalyptic number.
It is an amenable number.
20021112213 is a deficient number, since it is larger than the sum of its proper divisors (7065883947).
20021112213 is a wasteful number, since it uses less digits than its factorization.
20021112213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 256308.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 20021112213 its reverse (31221112002), we get a palindrome (51242224215).
The spelling of 20021112213 in words is "twenty billion, twenty-one million, one hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •