Base | Representation |
---|---|
bin | 1001001010111000111110… |
… | …11001111111111110110111 |
3 | 2122101210102021122222000022 |
4 | 10211130133121333332313 |
5 | 10120342213440122322 |
6 | 110515504531035355 |
7 | 4150621240641614 |
oct | 445343731777667 |
9 | 78353367588008 |
10 | 20165398364087 |
11 | 6475108736019 |
12 | 231823313bb5b |
13 | b33786a9a022 |
14 | 4da020acd50b |
15 | 24e835718942 |
hex | 12571f67ffb7 |
20165398364087 has 2 divisors, whose sum is σ = 20165398364088. Its totient is φ = 20165398364086.
The previous prime is 20165398364071. The next prime is 20165398364161. The reversal of 20165398364087 is 78046389356102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20165398364087 - 24 = 20165398364071 is a prime.
It is a super-2 number, since 2×201653983640872 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20165398364047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10082699182043 + 10082699182044.
It is an arithmetic number, because the mean of its divisors is an integer number (10082699182044).
It is a 1-persistent number, because it is pandigital, but 2⋅20165398364087 = 40330796728174 is not.
Almost surely, 220165398364087 is an apocalyptic number.
20165398364087 is a deficient number, since it is larger than the sum of its proper divisors (1).
20165398364087 is an equidigital number, since it uses as much as digits as its factorization.
20165398364087 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 52254720, while the sum is 62.
The spelling of 20165398364087 in words is "twenty trillion, one hundred sixty-five billion, three hundred ninety-eight million, three hundred sixty-four thousand, eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •