Base | Representation |
---|---|
bin | 1001011010101011… |
… | …00111111101001100 |
3 | 111001100000122002202 |
4 | 10231111213331030 |
5 | 40323214020300 |
6 | 2153355141032 |
7 | 236165660540 |
oct | 45525477514 |
9 | 14040018082 |
10 | 5055610700 |
11 | 2164840168 |
12 | b91144778 |
13 | 62752ca2a |
14 | 35d619a20 |
15 | 1e8c8dad5 |
hex | 12d567f4c |
5055610700 has 144 divisors (see below), whose sum is σ = 12739184640. Its totient is φ = 1705812480.
The previous prime is 5055610691. The next prime is 5055610711. The reversal of 5055610700 is 70165505.
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 47 ways as a sum of consecutive naturals, for example, 21697784 + ... + 21698016.
It is an arithmetic number, because the mean of its divisors is an integer number (88466560).
Almost surely, 25055610700 is an apocalyptic number.
5055610700 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 5055610700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6369592320).
5055610700 is an abundant number, since it is smaller than the sum of its proper divisors (7683573940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5055610700 is a wasteful number, since it uses less digits than its factorization.
5055610700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 616 (or 609 counting only the distinct ones).
The product of its (nonzero) digits is 5250, while the sum is 29.
The square root of 5055610700 is about 71102.8178063289. The cubic root of 5055610700 is about 1716.2921184093.
The spelling of 5055610700 in words is "five billion, fifty-five million, six hundred ten thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •