Base | Representation |
---|---|
bin | 1001100111110110… |
… | …01000101100001000 |
3 | 111100000221110002010 |
4 | 10303323020230020 |
5 | 41040010414100 |
6 | 2212343335520 |
7 | 242010121416 |
oct | 46373105410 |
9 | 14300843063 |
10 | 5166107400 |
11 | 2211150a53 |
12 | 10021515a0 |
13 | 6443aa1ac |
14 | 3701802b6 |
15 | 203818750 |
hex | 133ec8b08 |
5166107400 has 96 divisors (see below), whose sum is σ = 16061472000. Its totient is φ = 1373625600.
The previous prime is 5166107377. The next prime is 5166107411. The reversal of 5166107400 is 47016615.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 197065 + ... + 221735.
It is an arithmetic number, because the mean of its divisors is an integer number (167307000).
Almost surely, 25166107400 is an apocalyptic number.
5166107400 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 5166107400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8030736000).
5166107400 is an abundant number, since it is smaller than the sum of its proper divisors (10895364600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5166107400 is a wasteful number, since it uses less digits than its factorization.
5166107400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25039 (or 25030 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 30.
The square root of 5166107400 is about 71875.6384319472. The cubic root of 5166107400 is about 1728.7060166915.
The spelling of 5166107400 in words is "five billion, one hundred sixty-six million, one hundred seven thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •