Base | Representation |
---|---|
bin | 1001001011111001011011… |
… | …11001110000111000000011 |
3 | 2122112002201211012202102111 |
4 | 10211330231321300320003 |
5 | 10121424100313411321 |
6 | 110543430312200151 |
7 | 4153254602063512 |
oct | 445745571607003 |
9 | 78462654182374 |
10 | 20200001310211 |
11 | 6488855143658 |
12 | 2322a8b699057 |
13 | b36b0c971388 |
14 | 4db9845a0679 |
15 | 2506ad4b85e1 |
hex | 125f2de70e03 |
20200001310211 has 2 divisors, whose sum is σ = 20200001310212. Its totient is φ = 20200001310210.
The previous prime is 20200001310191. The next prime is 20200001310257. The reversal of 20200001310211 is 11201310000202.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20200001310211 - 217 = 20200001179139 is a prime.
It is a super-2 number, since 2×202000013102112 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20200001310191 and 20200001310200.
It is not a weakly prime, because it can be changed into another prime (20200001310271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10100000655105 + 10100000655106.
It is an arithmetic number, because the mean of its divisors is an integer number (10100000655106).
Almost surely, 220200001310211 is an apocalyptic number.
20200001310211 is a deficient number, since it is larger than the sum of its proper divisors (1).
20200001310211 is an equidigital number, since it uses as much as digits as its factorization.
20200001310211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 20200001310211 its reverse (11201310000202), we get a palindrome (31401311310413).
The spelling of 20200001310211 in words is "twenty trillion, two hundred billion, one million, three hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •