Base | Representation |
---|---|
bin | 1001000110101110010010… |
… | …1010010111001100101111 |
3 | 1022110001102110212022120220 |
4 | 2101223210222113030233 |
5 | 2303010223142004444 |
6 | 33143012425142423 |
7 | 2052164432620455 |
oct | 221534452271457 |
9 | 38401373768526 |
10 | 10011110109999 |
11 | 320a762739109 |
12 | 115827862aa13 |
13 | 578074b262cb |
14 | 26877c8a29d5 |
15 | 12562a4d2619 |
hex | 91ae4a9732f |
10011110109999 has 16 divisors (see below), whose sum is σ = 13377980819808. Its totient is φ = 6659167997952.
The previous prime is 10011110109989. The next prime is 10011110110009. The reversal of 10011110109999 is 99990101111001.
It is an interprime number because it is at equal distance from previous prime (10011110109989) and next prime (10011110110009).
It is not a de Polignac number, because 10011110109999 - 215 = 10011110077231 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10011110109999.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10011110109929) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2008779 + ... + 4904835.
It is an arithmetic number, because the mean of its divisors is an integer number (836123801238).
Almost surely, 210011110109999 is an apocalyptic number.
10011110109999 is a deficient number, since it is larger than the sum of its proper divisors (3366870709809).
10011110109999 is a wasteful number, since it uses less digits than its factorization.
10011110109999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2898634.
The product of its (nonzero) digits is 6561, while the sum is 42.
The spelling of 10011110109999 in words is "ten trillion, eleven billion, one hundred ten million, one hundred nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •