Base | Representation |
---|---|
bin | 1001100110000001110… |
… | …1110111100001000000 |
3 | 120202110002110021220112 |
4 | 2121200131313201000 |
5 | 10200031230341202 |
6 | 203415350530452 |
7 | 14623400036201 |
oct | 2314035674100 |
9 | 522402407815 |
10 | 164827199552 |
11 | 639a2725684 |
12 | 27b40366a28 |
13 | 1270a375612 |
14 | 7d98a735a8 |
15 | 444a65db52 |
hex | 2660777840 |
164827199552 has 56 divisors (see below), whose sum is σ = 333451297536. Its totient is φ = 80819025408.
The previous prime is 164827199543. The next prime is 164827199569. The reversal of 164827199552 is 255991728461.
164827199552 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 164827199491 and 164827199500.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 870038 + ... + 1042410.
It is an arithmetic number, because the mean of its divisors is an integer number (5954487456).
Almost surely, 2164827199552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 164827199552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166725648768).
164827199552 is an abundant number, since it is smaller than the sum of its proper divisors (168624097984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164827199552 is a wasteful number, since it uses less digits than its factorization.
164827199552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 172675 (or 172665 counting only the distinct ones).
The product of its digits is 10886400, while the sum is 59.
The spelling of 164827199552 in words is "one hundred sixty-four billion, eight hundred twenty-seven million, one hundred ninety-nine thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •