Base | Representation |
---|---|
bin | 1001100101010000101… |
… | …1011111000010110011 |
3 | 120201220201120000112221 |
4 | 2121110023133002303 |
5 | 10144120442213011 |
6 | 203343104301511 |
7 | 14615314605142 |
oct | 2312413370263 |
9 | 521821500487 |
10 | 164621054131 |
11 | 638a7325566 |
12 | 27aa3311897 |
13 | 126a6749091 |
14 | 7d79531759 |
15 | 44374dd971 |
hex | 26542df0b3 |
164621054131 has 2 divisors, whose sum is σ = 164621054132. Its totient is φ = 164621054130.
The previous prime is 164621054113. The next prime is 164621054167. The reversal of 164621054131 is 131450126461.
164621054131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (164621054113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 164621054131 - 25 = 164621054099 is a prime.
It is a super-2 number, since 2×1646210541312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (164621004131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 82310527065 + 82310527066.
It is an arithmetic number, because the mean of its divisors is an integer number (82310527066).
Almost surely, 2164621054131 is an apocalyptic number.
164621054131 is a deficient number, since it is larger than the sum of its proper divisors (1).
164621054131 is an equidigital number, since it uses as much as digits as its factorization.
164621054131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 34.
The spelling of 164621054131 in words is "one hundred sixty-four billion, six hundred twenty-one million, fifty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •