Base | Representation |
---|---|
bin | 10010111000100010… |
… | …11011010010110110 |
3 | 222011112110002202000 |
4 | 21130101123102312 |
5 | 131230312203320 |
6 | 4353552400130 |
7 | 506141430606 |
oct | 113421332266 |
9 | 28145402660 |
10 | 10138006710 |
11 | 4332705547 |
12 | 1b6b246046 |
13 | c5747a450 |
14 | 6c2608c06 |
15 | 3e506dc90 |
hex | 25c45b4b6 |
10138006710 has 64 divisors (see below), whose sum is σ = 29114285760. Its totient is φ = 2495508480.
The previous prime is 10138006699. The next prime is 10138006751. The reversal of 10138006710 is 1760083101.
10138006710 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 (27).
It is a congruent number.
It is an unprimeable number.
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, 1440651 + ... + 1447670.
It is an arithmetic number, because the mean of its divisors is an integer number (454910715).
Almost surely, 210138006710 is an apocalyptic number.
10138006710 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10138006710 is an abundant number, since it is smaller than the sum of its proper divisors (18976279050).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10138006710 is a wasteful number, since it uses less digits than its factorization.
10138006710 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2888350 (or 2888344 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
Adding to 10138006710 its reverse (1760083101), we get a palindrome (11898089811).
The spelling of 10138006710 in words is "ten billion, one hundred thirty-eight million, six thousand, seven hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •