Base | Representation |
---|---|
bin | 10010101001000101… |
… | …100001111010011101 |
3 | 1220122222220002212211 |
4 | 102221011201322131 |
5 | 311443231341232 |
6 | 13110122400421 |
7 | 1306013605402 |
oct | 225105417235 |
9 | 56588802784 |
10 | 20016668317 |
11 | 8541984198 |
12 | 3a67660111 |
13 | 1b6cc92749 |
14 | d7c5c42a9 |
15 | 7c245ea47 |
hex | 4a9161e9d |
20016668317 has 2 divisors, whose sum is σ = 20016668318. Its totient is φ = 20016668316.
The previous prime is 20016668299. The next prime is 20016668363. The reversal of 20016668317 is 71386661002.
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., 13588798041 + 6427870276 = 116571^2 + 80174^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20016668317 is a prime.
It is a super-2 number, since 2×200166683172 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20016668317.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20016668387) 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, 10008334158 + 10008334159.
It is an arithmetic number, because the mean of its divisors is an integer number (10008334159).
Almost surely, 220016668317 is an apocalyptic number.
It is an amenable number.
20016668317 is a deficient number, since it is larger than the sum of its proper divisors (1).
20016668317 is an equidigital number, since it uses as much as digits as its factorization.
20016668317 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72576, while the sum is 40.
The spelling of 20016668317 in words is "twenty billion, sixteen million, six hundred sixty-eight thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •