Base | Representation |
---|---|
bin | 10010101110000100… |
… | …101001001011011101 |
3 | 1220212211022011011212 |
4 | 102232010221023131 |
5 | 312131140301023 |
6 | 13122311354205 |
7 | 1311050626622 |
oct | 225604511335 |
9 | 56784264155 |
10 | 20100322013 |
11 | 8585120482 |
12 | 3a8b682965 |
13 | 1b84401b85 |
14 | d8975c349 |
15 | 7c9985e78 |
hex | 4ae1292dd |
20100322013 has 2 divisors, whose sum is σ = 20100322014. Its totient is φ = 20100322012.
The previous prime is 20100322009. The next prime is 20100322049. The reversal of 20100322013 is 31022300102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12603879289 + 7496442724 = 112267^2 + 86582^2 .
It is a cyclic number.
It is not a de Polignac number, because 20100322013 - 22 = 20100322009 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20100382013) 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, 10050161006 + 10050161007.
It is an arithmetic number, because the mean of its divisors is an integer number (10050161007).
Almost surely, 220100322013 is an apocalyptic number.
It is an amenable number.
20100322013 is a deficient number, since it is larger than the sum of its proper divisors (1).
20100322013 is an equidigital number, since it uses as much as digits as its factorization.
20100322013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 20100322013 its reverse (31022300102), we get a palindrome (51122622115).
The spelling of 20100322013 in words is "twenty billion, one hundred million, three hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •