Base | Representation |
---|---|
bin | 1001100011010001000… |
… | …0110000111010011011 |
3 | 120200112101221110111002 |
4 | 2120310100300322123 |
5 | 10142021401122011 |
6 | 203214015055215 |
7 | 14566123210433 |
oct | 2306420607233 |
9 | 520471843432 |
10 | 164085567131 |
11 | 63652030222 |
12 | 27973b1150b |
13 | 1261c81a675 |
14 | 7d2837d2c3 |
15 | 44054b5c3b |
hex | 2634430e9b |
164085567131 has 2 divisors, whose sum is σ = 164085567132. Its totient is φ = 164085567130.
The previous prime is 164085567097. The next prime is 164085567137. The reversal of 164085567131 is 131765580461.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 164085567131 - 210 = 164085566107 is a prime.
It is a super-2 number, since 2×1640855671312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (164085567137) 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, 82042783565 + 82042783566.
It is an arithmetic number, because the mean of its divisors is an integer number (82042783566).
Almost surely, 2164085567131 is an apocalyptic number.
164085567131 is a deficient number, since it is larger than the sum of its proper divisors (1).
164085567131 is an equidigital number, since it uses as much as digits as its factorization.
164085567131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 604800, while the sum is 47.
The spelling of 164085567131 in words is "one hundred sixty-four billion, eighty-five million, five hundred sixty-seven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •