Base | Representation |
---|---|
bin | 1001100101110011111… |
… | …1101010001011011011 |
3 | 120202022000211212010000 |
4 | 2121130333222023123 |
5 | 10144421322331310 |
6 | 203405510224043 |
7 | 14622061646322 |
oct | 2313477521333 |
9 | 522260755100 |
10 | 164768948955 |
11 | 6397285a096 |
12 | 27b24955023 |
13 | 126cb28ba00 |
14 | 7d9102d0b9 |
15 | 44454a44c0 |
hex | 265cfea2db |
164768948955 has 480 divisors, whose sum is σ = 370195531200. Its totient is φ = 69561483264.
The previous prime is 164768948941. The next prime is 164768948957. The reversal of 164768948955 is 559849867461.
164768948955 is a `hidden beast` number, since 1 + 64 + 7 + 6 + 89 + 489 + 5 + 5 = 666.
It is not a de Polignac number, because 164768948955 - 28 = 164768948699 is a prime.
It is not an unprimeable number, because it can be changed into a prime (164768948957) 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 in 479 ways as a sum of consecutive naturals, for example, 641124187 + ... + 641124443.
It is an arithmetic number, because the mean of its divisors is an integer number (771240690).
Almost surely, 2164768948955 is an apocalyptic number.
164768948955 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
164768948955 is an abundant number, since it is smaller than the sum of its proper divisors (205426582245).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164768948955 is a wasteful number, since it uses less digits than its factorization.
164768948955 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 365 (or 343 counting only the distinct ones).
The product of its digits is 522547200, while the sum is 72.
The spelling of 164768948955 in words is "one hundred sixty-four billion, seven hundred sixty-eight million, nine hundred forty-eight thousand, nine hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •