Base | Representation |
---|---|
bin | 1001100011001110011… |
… | …1101111101011111000 |
3 | 120200111122201011020101 |
4 | 2120303213233223320 |
5 | 10142011123023300 |
6 | 203212552405144 |
7 | 14565632623663 |
oct | 2306347575370 |
9 | 520448634211 |
10 | 164074814200 |
11 | 63646a56400 |
12 | 279703a67b4 |
13 | 1261a52419b |
14 | 7d26b806da |
15 | 440458eb6a |
hex | 26339efaf8 |
164074814200 has 72 divisors (see below), whose sum is σ = 419306131440. Its totient is φ = 59663560000.
The previous prime is 164074814191. The next prime is 164074814201. The reversal of 164074814200 is 2418470461.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 164074814200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164074814201) 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 17 ways as a sum of consecutive naturals, for example, 3365776 + ... + 3414175.
It is an arithmetic number, because the mean of its divisors is an integer number (5823696270).
Almost surely, 2164074814200 is an apocalyptic number.
164074814200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
164074814200 is an abundant number, since it is smaller than the sum of its proper divisors (255231317240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
164074814200 is a wasteful number, since it uses less digits than its factorization.
164074814200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6779989 (or 6779969 counting only the distinct ones).
The product of its (nonzero) digits is 43008, while the sum is 37.
The spelling of 164074814200 in words is "one hundred sixty-four billion, seventy-four million, eight hundred fourteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •