Base | Representation |
---|---|
bin | 110000110110011010… |
… | …011111000001000000 |
3 | 12000101111200002120221 |
4 | 300312122133001000 |
5 | 1324410321120000 |
6 | 40032451312424 |
7 | 3534552030556 |
oct | 606632370100 |
9 | 160344602527 |
10 | 52452520000 |
11 | 20277097691 |
12 | a1ba2ab714 |
13 | 4c3bbb6aaa |
14 | 2778341bd6 |
15 | 156ed4261a |
hex | c3669f040 |
52452520000 has 140 divisors (see below), whose sum is σ = 130474547280. Its totient is φ = 20915008000.
The previous prime is 52452519989. The next prime is 52452520007. The reversal of 52452520000 is 2525425.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (52452520007) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 13878111 + ... + 13881889.
It is an arithmetic number, because the mean of its divisors is an integer number (931961052).
Almost surely, 252452520000 is an apocalyptic number.
52452520000 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 52452520000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65237273640).
52452520000 is an abundant number, since it is smaller than the sum of its proper divisors (78022027280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52452520000 is an equidigital number, since it uses as much as digits as its factorization.
52452520000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4158 (or 4133 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 25.
The spelling of 52452520000 in words is "fifty-two billion, four hundred fifty-two million, five hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •