Base | Representation |
---|---|
bin | 1001100000101011… |
… | …10111010000010010 |
3 | 111011211211221002200 |
4 | 10300111313100102 |
5 | 40424114130020 |
6 | 2202355224030 |
7 | 240350216661 |
oct | 46025672022 |
9 | 14154757080 |
10 | 5106005010 |
11 | 2190230157 |
12 | ba5ba8016 |
13 | 634ac5752 |
14 | 3661b6dd8 |
15 | 1ed3e5590 |
hex | 130577412 |
5106005010 has 96 divisors (see below), whose sum is σ = 13566571200. Its totient is φ = 1332042624.
The previous prime is 5106004997. The next prime is 5106005017. The reversal of 5106005010 is 105006015.
5106005010 is a `hidden beast` number, since 5 + 1 + 0 + 600 + 50 + 10 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5106005017) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 895629 + ... + 901311.
It is an arithmetic number, because the mean of its divisors is an integer number (141318450).
Almost surely, 25106005010 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5106005010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6783285600).
5106005010 is an abundant number, since it is smaller than the sum of its proper divisors (8460566190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5106005010 is a wasteful number, since it uses less digits than its factorization.
5106005010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5912 (or 5909 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 18.
The square root of 5106005010 is about 71456.3153961915. The cubic root of 5106005010 is about 1721.9759392365.
The spelling of 5106005010 in words is "five billion, one hundred six million, five thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •