Base | Representation |
---|---|
bin | 1001001100100010011010… |
… | …1000010010100111101111 |
3 | 1022210121021001101221100111 |
4 | 2103020212220102213233 |
5 | 2311124312241023043 |
6 | 33300532500040451 |
7 | 2062332014253631 |
oct | 223104650224757 |
9 | 38717231357314 |
10 | 10111001111023 |
11 | 324906259670a |
12 | 11736b5993127 |
13 | 584603b911c7 |
14 | 26d53726ca51 |
15 | 128024d8b09d |
hex | 93226a129ef |
10111001111023 has 2 divisors, whose sum is σ = 10111001111024. Its totient is φ = 10111001111022.
The previous prime is 10111001110963. The next prime is 10111001111041. The reversal of 10111001111023 is 32011110011101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10111001111023 - 213 = 10111001102831 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10111001110994 and 10111001111012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111001111723) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055500555511 + 5055500555512.
It is an arithmetic number, because the mean of its divisors is an integer number (5055500555512).
Almost surely, 210111001111023 is an apocalyptic number.
10111001111023 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111001111023 is an equidigital number, since it uses as much as digits as its factorization.
10111001111023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 10111001111023 its reverse (32011110011101), we get a palindrome (42122111122124).
The spelling of 10111001111023 in words is "ten trillion, one hundred eleven billion, one million, one hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •