Base | Representation |
---|---|
bin | 1001000110000100111100… |
… | …0110101010010001001011 |
3 | 1022101222202221221200021122 |
4 | 2101201033012222101023 |
5 | 2302320010304324042 |
6 | 33133535221025455 |
7 | 2051322411054623 |
oct | 221411706522113 |
9 | 38358687850248 |
10 | 10000011011147 |
11 | 3205a87574943 |
12 | 115609b55528b |
13 | 576cc65123b1 |
14 | 268008797883 |
15 | 1251cadba7d2 |
hex | 9184f1aa44b |
10000011011147 has 2 divisors, whose sum is σ = 10000011011148. Its totient is φ = 10000011011146.
The previous prime is 10000011011033. The next prime is 10000011011197. The reversal of 10000011011147 is 74111011000001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10000011011147 - 232 = 9995716043851 is a prime.
It is a super-2 number, since 2×100000110111472 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10000011011197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000005505573 + 5000005505574.
It is an arithmetic number, because the mean of its divisors is an integer number (5000005505574).
Almost surely, 210000011011147 is an apocalyptic number.
10000011011147 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000011011147 is an equidigital number, since it uses as much as digits as its factorization.
10000011011147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 17.
Adding to 10000011011147 its reverse (74111011000001), we get a palindrome (84111022011148).
The spelling of 10000011011147 in words is "ten trillion, eleven million, eleven thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •