Base | Representation |
---|---|
bin | 100101011001111110010110… |
… | …010001010101001111011101 |
3 | 210120111020220200100001121110 |
4 | 211121332112101111033131 |
5 | 133030333403241331131 |
6 | 1341520023014052233 |
7 | 46436434625633604 |
oct | 4531762621251735 |
9 | 716436820301543 |
10 | 164512653464541 |
11 | 48467474054558 |
12 | 1654b7a294a079 |
13 | 70a462729a345 |
14 | 2c8a6523cca3b |
15 | 1404541c60646 |
hex | 959f964553dd |
164512653464541 has 4 divisors (see below), whose sum is σ = 219350204619392. Its totient is φ = 109675102309692.
The previous prime is 164512653464527. The next prime is 164512653464563. The reversal of 164512653464541 is 145464356215461.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 164512653464541 - 219 = 164512652940253 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164512653464741) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27418775577421 + ... + 27418775577426.
It is an arithmetic number, because the mean of its divisors is an integer number (54837551154848).
Almost surely, 2164512653464541 is an apocalyptic number.
It is an amenable number.
164512653464541 is a deficient number, since it is larger than the sum of its proper divisors (54837551154851).
164512653464541 is an equidigital number, since it uses as much as digits as its factorization.
164512653464541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54837551154850.
The product of its digits is 41472000, while the sum is 57.
The spelling of 164512653464541 in words is "one hundred sixty-four trillion, five hundred twelve billion, six hundred fifty-three million, four hundred sixty-four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •