Base | Representation |
---|---|
bin | 1001000110000101011110… |
… | …11111111001001010111101 |
3 | 2121211000022010202000022211 |
4 | 10203002233133321022331 |
5 | 10110141114344303423 |
6 | 110312003323340421 |
7 | 4132655243611642 |
oct | 443025737711275 |
9 | 77730263660284 |
10 | 20000312103613 |
11 | 64110a2859106 |
12 | 22b0240081711 |
13 | b21037b5ba2a |
14 | 4d203d8a1dc9 |
15 | 24a3c248610d |
hex | 1230af7f92bd |
20000312103613 has 2 divisors, whose sum is σ = 20000312103614. Its totient is φ = 20000312103612.
The previous prime is 20000312103557. The next prime is 20000312103631. The reversal of 20000312103613 is 31630121300002.
Together with next prime (20000312103631) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17173249859844 + 2827062243769 = 4144062^2 + 1681387^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20000312103613 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20000312103713) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000156051806 + 10000156051807.
It is an arithmetic number, because the mean of its divisors is an integer number (10000156051807).
Almost surely, 220000312103613 is an apocalyptic number.
It is an amenable number.
20000312103613 is a deficient number, since it is larger than the sum of its proper divisors (1).
20000312103613 is an equidigital number, since it uses as much as digits as its factorization.
20000312103613 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 20000312103613 its reverse (31630121300002), we get a palindrome (51630433403615).
The spelling of 20000312103613 in words is "twenty trillion, three hundred twelve million, one hundred three thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •