Base | Representation |
---|---|
bin | 1001100100011111101… |
… | …1001110010110111101 |
3 | 120201101101201000010201 |
4 | 2121013323032112331 |
5 | 10143210324334033 |
6 | 203310442003501 |
7 | 14610240251461 |
oct | 2310773162675 |
9 | 521341630121 |
10 | 164415464893 |
11 | 638012752a9 |
12 | 27a464a6591 |
13 | 12672c85a44 |
14 | 7d5a0d64a1 |
15 | 442442d47d |
hex | 2647ece5bd |
164415464893 has 2 divisors, whose sum is σ = 164415464894. Its totient is φ = 164415464892.
The previous prime is 164415464891. The next prime is 164415464959. The reversal of 164415464893 is 398464514461.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 105717320164 + 58698144729 = 325142^2 + 242277^2 .
It is a cyclic number.
It is not a de Polignac number, because 164415464893 - 21 = 164415464891 is a prime.
It is a super-3 number, since 3×1644154648933 (a number of 35 digits) contains 333 as substring.
Together with 164415464891, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (164415464891) 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, 82207732446 + 82207732447.
It is an arithmetic number, because the mean of its divisors is an integer number (82207732447).
Almost surely, 2164415464893 is an apocalyptic number.
It is an amenable number.
164415464893 is a deficient number, since it is larger than the sum of its proper divisors (1).
164415464893 is an equidigital number, since it uses as much as digits as its factorization.
164415464893 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9953280, while the sum is 55.
The spelling of 164415464893 in words is "one hundred sixty-four billion, four hundred fifteen million, four hundred sixty-four thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •