Base | Representation |
---|---|
bin | 110000100100010000… |
… | …001000000000000000 |
3 | 11222121021022110002100 |
4 | 300210100020000000 |
5 | 1323244320030100 |
6 | 35542324350400 |
7 | 3524162052213 |
oct | 604420100000 |
9 | 158537273070 |
10 | 52147814400 |
11 | 20130099880 |
12 | a134245400 |
13 | 4bc0a2c216 |
14 | 2749aa577a |
15 | 1553204400 |
hex | c24408000 |
52147814400 has 576 divisors, whose sum is σ = 204101155440. Its totient is φ = 12622233600.
The previous prime is 52147814363. The next prime is 52147814401. The reversal of 52147814400 is 441874125.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (576).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (52147814401) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 81100479 + ... + 81101121.
Almost surely, 252147814400 is an apocalyptic number.
52147814400 is a gapful number since it is divisible by the number (50) 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 52147814400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (102050577720).
52147814400 is an abundant number, since it is smaller than the sum of its proper divisors (151953341040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52147814400 is a wasteful number, since it uses less digits than its factorization.
52147814400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 700 (or 664 counting only the distinct ones).
The product of its (nonzero) digits is 35840, while the sum is 36.
The spelling of 52147814400 in words is "fifty-two billion, one hundred forty-seven million, eight hundred fourteen thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •