Base | Representation |
---|---|
bin | 1001110001111110… |
… | …10111011011000000 |
3 | 111112221212122022002 |
4 | 10320333113123000 |
5 | 41223240234100 |
6 | 2225021203132 |
7 | 244061430305 |
oct | 47077273300 |
9 | 14487778262 |
10 | 5251102400 |
11 | 2255123a55 |
12 | 10267004a8 |
13 | 658b98cab |
14 | 37b5870ac |
15 | 20b0072d5 |
hex | 138fd76c0 |
5251102400 has 168 divisors, whose sum is σ = 13920728064. Its totient is φ = 1943884800.
The previous prime is 5251102399. The next prime is 5251102411. The reversal of 5251102400 is 42011525.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1138499 + ... + 1143101.
Almost surely, 25251102400 is an apocalyptic number.
5251102400 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 5251102400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6960364032).
5251102400 is an abundant number, since it is smaller than the sum of its proper divisors (8669625664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5251102400 is a wasteful number, since it uses less digits than its factorization.
5251102400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4679 (or 4664 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 20.
The square root of 5251102400 is about 72464.4906143692. The cubic root of 5251102400 is about 1738.1349638271.
Adding to 5251102400 its reverse (42011525), we get a palindrome (5293113925).
The spelling of 5251102400 in words is "five billion, two hundred fifty-one million, one hundred two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •