Base | Representation |
---|---|
bin | 1001100100010100000… |
… | …0011100010100011001 |
3 | 120201020222120101111120 |
4 | 2121011000130110121 |
5 | 10143110311014040 |
6 | 203301532315453 |
7 | 14606104131150 |
oct | 2310500342431 |
9 | 521228511446 |
10 | 164366501145 |
11 | 637866720a0 |
12 | 27a32012b89 |
13 | 12665aa1202 |
14 | 7d537cc597 |
15 | 441eeaa7d0 |
hex | 264501c519 |
164366501145 has 64 divisors (see below), whose sum is σ = 342134820864. Its totient is φ = 65338225920.
The previous prime is 164366501137. The next prime is 164366501147. The reversal of 164366501145 is 541105663461.
It is not a de Polignac number, because 164366501145 - 23 = 164366501137 is a prime.
It is a super-2 number, since 2×1643665011452 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 164366501097 and 164366501106.
It is not an unprimeable number, because it can be changed into a prime (164366501147) 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, 3067102 + ... + 3120231.
It is an arithmetic number, because the mean of its divisors is an integer number (5345856576).
Almost surely, 2164366501145 is an apocalyptic number.
164366501145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
164366501145 is an abundant number, since it is smaller than the sum of its proper divisors (177768319719).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164366501145 is a wasteful number, since it uses less digits than its factorization.
164366501145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6187382.
The product of its (nonzero) digits is 259200, while the sum is 42.
The spelling of 164366501145 in words is "one hundred sixty-four billion, three hundred sixty-six million, five hundred one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •