Base | Representation |
---|---|
bin | 1001100111111010… |
… | …00101111010001100 |
3 | 111100001220111122102 |
4 | 10303331011322030 |
5 | 41040123322200 |
6 | 2212402334232 |
7 | 242014355642 |
oct | 46375057214 |
9 | 14301814572 |
10 | 5166620300 |
11 | 2211471336 |
12 | 100235a378 |
13 | 64452979a |
14 | 370275192 |
15 | 2038ba6d5 |
hex | 133f45e8c |
5166620300 has 72 divisors (see below), whose sum is σ = 11406769920. Its totient is φ = 2030862400.
The previous prime is 5166620287. The next prime is 5166620339. The reversal of 5166620300 is 30266615.
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, 2547887 + ... + 2549913.
It is an arithmetic number, because the mean of its divisors is an integer number (158427360).
Almost surely, 25166620300 is an apocalyptic number.
5166620300 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 5166620300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5703384960).
5166620300 is an abundant number, since it is smaller than the sum of its proper divisors (6240149620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5166620300 is a wasteful number, since it uses less digits than its factorization.
5166620300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2471 (or 2464 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 29.
The square root of 5166620300 is about 71879.2063117005. The cubic root of 5166620300 is about 1728.7632244307.
Adding to 5166620300 its reverse (30266615), we get a palindrome (5196886915).
The spelling of 5166620300 in words is "five billion, one hundred sixty-six million, six hundred twenty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •