Base | Representation |
---|---|
bin | 1001100101001101001… |
… | …0011000011111010000 |
3 | 120201212200101111212100 |
4 | 2121103102120133100 |
5 | 10144103124210242 |
6 | 203341411400400 |
7 | 14615043431442 |
oct | 2312322303720 |
9 | 521780344770 |
10 | 164606085072 |
11 | 63899931040 |
12 | 27a9a2b3100 |
13 | 126a3607850 |
14 | 7d77556492 |
15 | 443603354c |
hex | 26534987d0 |
164606085072 has 240 divisors, whose sum is σ = 558665243136. Its totient is φ = 44558208000.
The previous prime is 164606085023. The next prime is 164606085109. The reversal of 164606085072 is 270580606461.
164606085072 is a `hidden beast` number, since 16 + 460 + 60 + 8 + 50 + 72 = 666.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 509422 + ... + 767282.
Almost surely, 2164606085072 is an apocalyptic number.
164606085072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 164606085072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (279332621568).
164606085072 is an abundant number, since it is smaller than the sum of its proper divisors (394059158064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164606085072 is a wasteful number, since it uses less digits than its factorization.
164606085072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257930 (or 257921 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 45.
The spelling of 164606085072 in words is "one hundred sixty-four billion, six hundred six million, eighty-five thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •