Base | Representation |
---|---|
bin | 1001011011110111… |
… | …11011100010110000 |
3 | 111002000220210201120 |
4 | 10231323323202300 |
5 | 40333301334100 |
6 | 2154354302240 |
7 | 236350222614 |
oct | 45573734260 |
9 | 14060823646 |
10 | 5065652400 |
11 | 216a479696 |
12 | b94587980 |
13 | 629637573 |
14 | 360ab1344 |
15 | 1e9ac40a0 |
hex | 12defb8b0 |
5065652400 has 120 divisors (see below), whose sum is σ = 16263948624. Its totient is φ = 1347763200.
The previous prime is 5065652393. The next prime is 5065652413. The reversal of 5065652400 is 42565605.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (120).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 548622 + ... + 557778.
Almost surely, 25065652400 is an apocalyptic number.
5065652400 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 5065652400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8131974312).
5065652400 is an abundant number, since it is smaller than the sum of its proper divisors (11198296224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5065652400 is a wasteful number, since it uses less digits than its factorization.
5065652400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9639 (or 9628 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 33.
The square root of 5065652400 is about 71173.3967153458. The cubic root of 5065652400 is about 1717.4276945379.
The spelling of 5065652400 in words is "five billion, sixty-five million, six hundred fifty-two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •