Base | Representation |
---|---|
bin | 1001000110101110010010… |
… | …1010101100001111111111 |
3 | 1022110001102111000200212101 |
4 | 2101223210222230033333 |
5 | 2303010223202234343 |
6 | 33143012431045531 |
7 | 2052164433430033 |
oct | 221534452541777 |
9 | 38401374020771 |
10 | 10011110196223 |
11 | 320a762797974 |
12 | 11582786708a7 |
13 | 578074b56626 |
14 | 26877c8c61c3 |
15 | 12562a4ece4d |
hex | 91ae4aac3ff |
10011110196223 has 2 divisors, whose sum is σ = 10011110196224. Its totient is φ = 10011110196222.
The previous prime is 10011110196193. The next prime is 10011110196257. The reversal of 10011110196223 is 32269101111001.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10011110196223 is a prime.
It is a super-2 number, since 2×100111101962232 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10011110196191 and 10011110196200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10011110193223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5005555098111 + 5005555098112.
It is an arithmetic number, because the mean of its divisors is an integer number (5005555098112).
Almost surely, 210011110196223 is an apocalyptic number.
10011110196223 is a deficient number, since it is larger than the sum of its proper divisors (1).
10011110196223 is an equidigital number, since it uses as much as digits as its factorization.
10011110196223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 28.
The spelling of 10011110196223 in words is "ten trillion, eleven billion, one hundred ten million, one hundred ninety-six thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •