Base | Representation |
---|---|
bin | 10010101000110000… |
… | …101010111000011111 |
3 | 1220122121121021210201 |
4 | 102220300222320133 |
5 | 311440331400111 |
6 | 13105405244331 |
7 | 1305616252024 |
oct | 225060527037 |
9 | 56577537721 |
10 | 20011200031 |
11 | 8539889849 |
12 | 3a658636a7 |
13 | 1b6bac9784 |
14 | d7b99d54b |
15 | 7c1c2e6c1 |
hex | 4a8c2ae1f |
20011200031 has 2 divisors, whose sum is σ = 20011200032. Its totient is φ = 20011200030.
The previous prime is 20011199981. The next prime is 20011200059. The reversal of 20011200031 is 13000211002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20011200031 - 215 = 20011167263 is a prime.
It is a super-2 number, since 2×200112000312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20011199990 and 20011200017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20011200431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10005600015 + 10005600016.
It is an arithmetic number, because the mean of its divisors is an integer number (10005600016).
Almost surely, 220011200031 is an apocalyptic number.
20011200031 is a deficient number, since it is larger than the sum of its proper divisors (1).
20011200031 is an equidigital number, since it uses as much as digits as its factorization.
20011200031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 20011200031 its reverse (13000211002), we get a palindrome (33011411033).
The spelling of 20011200031 in words is "twenty billion, eleven million, two hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •