Base | Representation |
---|---|
bin | 100101010010101111000110… |
… | …001011110011101100011111 |
3 | 210111201201000011020200110102 |
4 | 211102233012023303230133 |
5 | 132444211203211211242 |
6 | 1340455321145131315 |
7 | 46355465400506000 |
oct | 4522570613635437 |
9 | 714651004220412 |
10 | 164015241116447 |
11 | 48295522818256 |
12 | 1648b304489b3b |
13 | 706975628ac56 |
14 | 2c70546b151a7 |
15 | 13e662d3bde32 |
hex | 952bc62f3b1f |
164015241116447 has 64 divisors (see below), whose sum is σ = 207567824486400. Its totient is φ = 129038694220800.
The previous prime is 164015241116437. The next prime is 164015241116449. The reversal of 164015241116447 is 744611142510461.
It is a happy number.
It is not a de Polignac number, because 164015241116447 - 216 = 164015241050911 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164015241116449) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 75945122 + ... + 78074912.
It is an arithmetic number, because the mean of its divisors is an integer number (3243247257600).
Almost surely, 2164015241116447 is an apocalyptic number.
164015241116447 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
164015241116447 is a deficient number, since it is larger than the sum of its proper divisors (43552583369953).
164015241116447 is a wasteful number, since it uses less digits than its factorization.
164015241116447 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2130157 (or 2130143 counting only the distinct ones).
The product of its (nonzero) digits is 645120, while the sum is 47.
The spelling of 164015241116447 in words is "one hundred sixty-four trillion, fifteen billion, two hundred forty-one million, one hundred sixteen thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •