Base | Representation |
---|---|
bin | 1001011111111101… |
… | …11110100011100000 |
3 | 111011102120010110022 |
4 | 10233332332203200 |
5 | 40421100134400 |
6 | 2202022453012 |
7 | 240245221664 |
oct | 45776764340 |
9 | 14142503408 |
10 | 5100005600 |
11 | 2187902768 |
12 | ba3b94168 |
13 | 6337a4ac1 |
14 | 3654948a4 |
15 | 1ecb0cb85 |
hex | 12ffbe8e0 |
5100005600 has 72 divisors (see below), whose sum is σ = 12515948928. Its totient is φ = 2029260800.
The previous prime is 5100005597. The next prime is 5100005611. The reversal of 5100005600 is 65000015.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 136112 + ... + 169488.
It is an arithmetic number, because the mean of its divisors is an integer number (173832624).
Almost surely, 25100005600 is an apocalyptic number.
5100005600 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 5100005600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6257974464).
5100005600 is an abundant number, since it is smaller than the sum of its proper divisors (7415943328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5100005600 is a wasteful number, since it uses less digits than its factorization.
5100005600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33588 (or 33575 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 17.
The square root of 5100005600 is about 71414.3234932601. The cubic root of 5100005600 is about 1721.3012507446.
Adding to 5100005600 its reverse (65000015), we get a palindrome (5165005615).
The spelling of 5100005600 in words is "five billion, one hundred million, five thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •