Base | Representation |
---|---|
bin | 1001100000000101… |
… | …10010110100011110 |
3 | 111011111102221220020 |
4 | 10300002302310132 |
5 | 40421324143420 |
6 | 2202100133010 |
7 | 240256556634 |
oct | 46002626436 |
9 | 14144387806 |
10 | 5101006110 |
11 | 2188426432 |
12 | ba4397166 |
13 | 633a65315 |
14 | 365675354 |
15 | 1ecc59340 |
hex | 1300b2d1e |
5101006110 has 64 divisors (see below), whose sum is σ = 12585326400. Its totient is φ = 1322237952.
The previous prime is 5101006091. The next prime is 5101006121. The reversal of 5101006110 is 116001015.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 5101006110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1895646 + ... + 1898334.
It is an arithmetic number, because the mean of its divisors is an integer number (196645725).
Almost surely, 25101006110 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5101006110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6292663200).
5101006110 is an abundant number, since it is smaller than the sum of its proper divisors (7484320290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5101006110 is a wasteful number, since it uses less digits than its factorization.
5101006110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4445.
The product of its (nonzero) digits is 30, while the sum is 15.
The square root of 5101006110 is about 71421.3281170268. The cubic root of 5101006110 is about 1721.4138039876.
Adding to 5101006110 its reverse (116001015), we get a palindrome (5217007125).
The spelling of 5101006110 in words is "five billion, one hundred one million, six thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •