Base | Representation |
---|---|
bin | 10011100011101100… |
… | …10111000000101011 |
3 | 1000002202121202221021 |
4 | 21301312113000223 |
5 | 133001000310102 |
6 | 4453523353311 |
7 | 521125420063 |
oct | 116166270053 |
9 | 30082552837 |
10 | 10500010027 |
11 | 44a8a88a41 |
12 | 2050522837 |
13 | cb4476cb0 |
14 | 71871c3a3 |
15 | 416c29137 |
hex | 271d9702b |
10500010027 has 8 divisors (see below), whose sum is σ = 11332893600. Its totient is φ = 9670725120.
The previous prime is 10500010013. The next prime is 10500010039. The reversal of 10500010027 is 72001000501.
10500010027 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10500010027 - 27 = 10500009899 is a prime.
It is a super-2 number, since 2×105000100272 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10500010057) 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 7 ways as a sum of consecutive naturals, for example, 893599 + ... + 905272.
It is an arithmetic number, because the mean of its divisors is an integer number (1416611700).
Almost surely, 210500010027 is an apocalyptic number.
10500010027 is a deficient number, since it is larger than the sum of its proper divisors (832883573).
10500010027 is a wasteful number, since it uses less digits than its factorization.
10500010027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1799333.
The product of its (nonzero) digits is 70, while the sum is 16.
Adding to 10500010027 its reverse (72001000501), we get a palindrome (82501010528).
The spelling of 10500010027 in words is "ten billion, five hundred million, ten thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •