Base | Representation |
---|---|
bin | 1001000110101100011010… |
… | …01011010100011000111011 |
3 | 2121220000020121221002212122 |
4 | 10203112031023110120323 |
5 | 10111011420021334321 |
6 | 110325341210031455 |
7 | 4134325163413256 |
oct | 443261513243073 |
9 | 77800217832778 |
10 | 20021211121211 |
11 | 6419a477a9383 |
12 | 22b42b311858b |
13 | b22cb8877b31 |
14 | 4d306332a09d |
15 | 24abe70d78ab |
hex | 12358d2d463b |
20021211121211 has 8 divisors (see below), whose sum is σ = 20382024650064. Its totient is φ = 19663548802560.
The previous prime is 20021211121207. The next prime is 20021211121273. The reversal of 20021211121211 is 11212111212002.
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 20021211121211 - 22 = 20021211121207 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20021211121211.
It is not an unprimeable number, because it can be changed into a prime (20021211121291) 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, 787789730 + ... + 787815143.
It is an arithmetic number, because the mean of its divisors is an integer number (2547753081258).
Almost surely, 220021211121211 is an apocalyptic number.
20021211121211 is a deficient number, since it is larger than the sum of its proper divisors (360813528853).
20021211121211 is a wasteful number, since it uses less digits than its factorization.
20021211121211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1575605101.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 20021211121211 its reverse (11212111212002), we get a palindrome (31233322333213).
The spelling of 20021211121211 in words is "twenty trillion, twenty-one billion, two hundred eleven million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •