Base | Representation |
---|---|
bin | 1001001011111001011100… |
… | …11110110001100001110011 |
3 | 2122112002202111110200001211 |
4 | 10211330232132301201303 |
5 | 10121424110304342321 |
6 | 110543431300140551 |
7 | 4153255050412312 |
oct | 445745636614163 |
9 | 78462674420054 |
10 | 20200011012211 |
11 | 648885a66a938 |
12 | 2322a92997757 |
13 | b36b1198a3c4 |
14 | 4db9859a8279 |
15 | 2506ae2830e1 |
hex | 125f2e7b1873 |
20200011012211 has 16 divisors (see below), whose sum is σ = 21147902899200. Its totient is φ = 19257927467328.
The previous prime is 20200011012133. The next prime is 20200011012239. The reversal of 20200011012211 is 11221011000202.
It is a cyclic number.
It is not a de Polignac number, because 20200011012211 - 227 = 20199876794483 is a prime.
It is a super-2 number, since 2×202000110122112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20200011012191 and 20200011012200.
It is not an unprimeable number, because it can be changed into a prime (20200011012281) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 194330310 + ... + 194434228.
It is an arithmetic number, because the mean of its divisors is an integer number (1321743931200).
Almost surely, 220200011012211 is an apocalyptic number.
20200011012211 is a deficient number, since it is larger than the sum of its proper divisors (947891886989).
20200011012211 is a wasteful number, since it uses less digits than its factorization.
20200011012211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131778.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20200011012211 its reverse (11221011000202), we get a palindrome (31421022012413).
The spelling of 20200011012211 in words is "twenty trillion, two hundred billion, eleven million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •