Base | Representation |
---|---|
bin | 1001000110010001011100… |
… | …11101000011111101101001 |
3 | 2121211121212220101100102202 |
4 | 10203020232131003331221 |
5 | 10110242244140110423 |
6 | 110314545040105545 |
7 | 4133303410620443 |
oct | 443105635037551 |
9 | 77747786340382 |
10 | 20006737035113 |
11 | 641389a533254 |
12 | 22b15339052b5 |
13 | b2181cc8804a |
14 | 4d248ccc5493 |
15 | 24a64b559728 |
hex | 12322e743f69 |
20006737035113 has 2 divisors, whose sum is σ = 20006737035114. Its totient is φ = 20006737035112.
The previous prime is 20006737035059. The next prime is 20006737035169. The reversal of 20006737035113 is 31153073760002.
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., 19847310121024 + 159426914089 = 4455032^2 + 399283^2 .
It is a cyclic number.
It is not a de Polignac number, because 20006737035113 - 216 = 20006736969577 is a prime.
It is a super-2 number, since 2×200067370351132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20006737035013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10003368517556 + 10003368517557.
It is an arithmetic number, because the mean of its divisors is an integer number (10003368517557).
Almost surely, 220006737035113 is an apocalyptic number.
It is an amenable number.
20006737035113 is a deficient number, since it is larger than the sum of its proper divisors (1).
20006737035113 is an equidigital number, since it uses as much as digits as its factorization.
20006737035113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 79380, while the sum is 38.
The spelling of 20006737035113 in words is "twenty trillion, six billion, seven hundred thirty-seven million, thirty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •