Base | Representation |
---|---|
bin | 1001000110011011101000… |
… | …01101000101101010110011 |
3 | 2121212010222210002111222122 |
4 | 10203031310031011222303 |
5 | 10110334442232021321 |
6 | 110321251230024455 |
7 | 4133556012130625 |
oct | 443156415055263 |
9 | 77763883074878 |
10 | 20012202220211 |
11 | 6416144488753 |
12 | 22b25ba04812b |
13 | b221b12cc296 |
14 | 4d284aa78c15 |
15 | 24a86b24d8ab |
hex | 123374345ab3 |
20012202220211 has 8 divisors (see below), whose sum is σ = 20016689018304. Its totient is φ = 20007715685760.
The previous prime is 20012202220187. The next prime is 20012202220271. The reversal of 20012202220211 is 11202220221002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20012202220211 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 20012202220211.
It is not an unprimeable number, because it can be changed into a prime (20012202220271) 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, 260601641 + ... + 260678421.
It is an arithmetic number, because the mean of its divisors is an integer number (2502086127288).
Almost surely, 220012202220211 is an apocalyptic number.
20012202220211 is a deficient number, since it is larger than the sum of its proper divisors (4486798093).
20012202220211 is an equidigital number, since it uses as much as digits as its factorization.
20012202220211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131821.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 20012202220211 its reverse (11202220221002), we get a palindrome (31214422441213).
The spelling of 20012202220211 in words is "twenty trillion, twelve billion, two hundred two million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •