Base | Representation |
---|---|
bin | 10010101000110100… |
… | …01111101000011110 |
3 | 221211100020120110012 |
4 | 21110122033220132 |
5 | 130443030204020 |
6 | 4332521243222 |
7 | 502650310460 |
oct | 112432175036 |
9 | 27740216405 |
10 | 10006100510 |
11 | 427520145a |
12 | 1b33033512 |
13 | c36045143 |
14 | 6accb0130 |
15 | 3d86b57c5 |
hex | 25468fa1e |
10006100510 has 64 divisors (see below), whose sum is σ = 21019727232. Its totient is φ = 3358734336.
The previous prime is 10006100479. The next prime is 10006100519. The reversal of 10006100510 is 1500160001.
10006100510 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10006100519) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 692924 + ... + 707216.
It is an arithmetic number, because the mean of its divisors is an integer number (328433238).
Almost surely, 210006100510 is an apocalyptic number.
10006100510 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10006100510 is an abundant number, since it is smaller than the sum of its proper divisors (11013626722).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10006100510 is a wasteful number, since it uses less digits than its factorization.
10006100510 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14517.
The product of its (nonzero) digits is 30, while the sum is 14.
Adding to 10006100510 its reverse (1500160001), we get a palindrome (11506260511).
The spelling of 10006100510 in words is "ten billion, six million, one hundred thousand, five hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •