Base | Representation |
---|---|
bin | 1001110100011110… |
… | …10101101011110000 |
3 | 111121102022202001100 |
4 | 10322033111223300 |
5 | 41244122114200 |
6 | 2231050404400 |
7 | 244434554100 |
oct | 47217255360 |
9 | 14542282040 |
10 | 5272066800 |
11 | 2265a42900 |
12 | 1031730700 |
13 | 660329370 |
14 | 380283200 |
15 | 20cc98d00 |
hex | 13a3d5af0 |
5272066800 has 1620 divisors, whose sum is σ = 26518641240. Its totient is φ = 958003200.
The previous prime is 5272066777. The next prime is 5272066847. The reversal of 5272066800 is 86602725.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 323 ways as a sum of consecutive naturals, for example, 277477191 + ... + 277477209.
Almost surely, 25272066800 is an apocalyptic number.
5272066800 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 5272066800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13259320620).
5272066800 is an abundant number, since it is smaller than the sum of its proper divisors (21246574440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5272066800 is a wasteful number, since it uses less digits than its factorization.
5272066800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92 (or 60 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 36.
The square root of 5272066800 is about 72608.9994422179. Note that the first 3 decimals coincide. The cubic root of 5272066800 is about 1740.4449912210. Note that the first 3 decimals are identical.
The spelling of 5272066800 in words is "five billion, two hundred seventy-two million, sixty-six thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •