Base | Representation |
---|---|
bin | 10010101000101100… |
… | …100001010000001101 |
3 | 1220122112120000022202 |
4 | 102220230201100031 |
5 | 311440042041023 |
6 | 13105330051245 |
7 | 1305604100663 |
oct | 225054412015 |
9 | 56575500282 |
10 | 20010112013 |
11 | 8539206361 |
12 | 3a65419b25 |
13 | 1b6b808488 |
14 | d7b798c33 |
15 | 7c1ab7128 |
hex | 4a8b2140d |
20010112013 has 2 divisors, whose sum is σ = 20010112014. Its totient is φ = 20010112012.
The previous prime is 20010112007. The next prime is 20010112037. The reversal of 20010112013 is 31021101002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16799529769 + 3210582244 = 129613^2 + 56662^2 .
It is a cyclic number.
It is not a de Polignac number, because 20010112013 - 214 = 20010095629 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20010111985 and 20010112003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20010112093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10005056006 + 10005056007.
It is an arithmetic number, because the mean of its divisors is an integer number (10005056007).
Almost surely, 220010112013 is an apocalyptic number.
It is an amenable number.
20010112013 is a deficient number, since it is larger than the sum of its proper divisors (1).
20010112013 is an equidigital number, since it uses as much as digits as its factorization.
20010112013 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 11.
Adding to 20010112013 its reverse (31021101002), we get a palindrome (51031213015).
The spelling of 20010112013 in words is "twenty billion, ten million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •