Base | Representation |
---|---|
bin | 1001000110101101111010… |
… | …1100111001011001110101 |
3 | 1022110001011111200211212201 |
4 | 2101223132230321121311 |
5 | 2303010022042023333 |
6 | 33142554453544501 |
7 | 2052162106631455 |
oct | 221533654713165 |
9 | 38401144624781 |
10 | 10011010111093 |
11 | 320a711248492 |
12 | 115824b045131 |
13 | 57805a1b3164 |
14 | 26876d4b1d65 |
15 | 12562182d17d |
hex | 91adeb39675 |
10011010111093 has 2 divisors, whose sum is σ = 10011010111094. Its totient is φ = 10011010111092.
The previous prime is 10011010111051. The next prime is 10011010111169. The reversal of 10011010111093 is 39011101011001.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6564781725489 + 3446228385604 = 2562183^2 + 1856402^2 .
It is a cyclic number.
It is not a de Polignac number, because 10011010111093 - 229 = 10010473240181 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10011010111093.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10011010121093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005505055546 + 5005505055547.
It is an arithmetic number, because the mean of its divisors is an integer number (5005505055547).
Almost surely, 210011010111093 is an apocalyptic number.
It is an amenable number.
10011010111093 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011010111093 is an equidigital number, since it uses as much as digits as its factorization.
10011010111093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 19.
Adding to 10011010111093 its reverse (39011101011001), we get a palindrome (49022111122094).
The spelling of 10011010111093 in words is "ten trillion, eleven billion, ten million, one hundred eleven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •