Base | Representation |
---|---|
bin | 1010100011011110… |
… | …00010010110101000 |
3 | 112121220001102202121 |
4 | 11101233002112220 |
5 | 43101030032300 |
6 | 2334131241024 |
7 | 260262230500 |
oct | 52157022650 |
9 | 15556042677 |
10 | 5666252200 |
11 | 24484a7164 |
12 | 1121749174 |
13 | 6c3bb316b |
14 | 3ba772a00 |
15 | 2326ae81a |
hex | 151bc25a8 |
5666252200 has 144 divisors (see below), whose sum is σ = 16132003200. Its totient is φ = 1840406400.
The previous prime is 5666252197. The next prime is 5666252233. The reversal of 5666252200 is 22526665.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 170985 + ... + 201415.
It is an arithmetic number, because the mean of its divisors is an integer number (112027800).
Almost surely, 25666252200 is an apocalyptic number.
5666252200 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 5666252200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8066001600).
5666252200 is an abundant number, since it is smaller than the sum of its proper divisors (10465751000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5666252200 is a wasteful number, since it uses less digits than its factorization.
5666252200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30480 (or 30464 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 34.
The square root of 5666252200 is about 75274.5122866964. The cubic root of 5666252200 is about 1782.7836133300.
Adding to 5666252200 its reverse (22526665), we get a palindrome (5688778865).
The spelling of 5666252200 in words is "five billion, six hundred sixty-six million, two hundred fifty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •