Base | Representation |
---|---|
bin | 10010101111010011… |
… | …100100011100101101 |
3 | 1220221021020022112011 |
4 | 102233103210130231 |
5 | 312201434341023 |
6 | 13124331041221 |
7 | 1311421531414 |
oct | 225723443455 |
9 | 56837208464 |
10 | 20121012013 |
11 | 8595872153 |
12 | 3a965a0211 |
13 | 1b8879738b |
14 | d8c3c647b |
15 | 7cb6c150d |
hex | 4af4e472d |
20121012013 has 2 divisors, whose sum is σ = 20121012014. Its totient is φ = 20121012012.
The previous prime is 20121012011. The next prime is 20121012017. The reversal of 20121012013 is 31021012102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19071057604 + 1049954409 = 138098^2 + 32403^2 .
It is a cyclic number.
It is not a de Polignac number, because 20121012013 - 21 = 20121012011 is a prime.
Together with 20121012011, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 20121011984 and 20121012002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20121012011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10060506006 + 10060506007.
It is an arithmetic number, because the mean of its divisors is an integer number (10060506007).
Almost surely, 220121012013 is an apocalyptic number.
It is an amenable number.
20121012013 is a deficient number, since it is larger than the sum of its proper divisors (1).
20121012013 is an equidigital number, since it uses as much as digits as its factorization.
20121012013 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 20121012013 its reverse (31021012102), we get a palindrome (51142024115).
The spelling of 20121012013 in words is "twenty billion, one hundred twenty-one million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •