Base | Representation |
---|---|
bin | 10000000001011000101… |
… | …110000111001110101111 |
3 | 10220020212120221200010202 |
4 | 100001120232013032233 |
5 | 121014322012023043 |
6 | 2201443101224115 |
7 | 142354544350061 |
oct | 20013056071657 |
9 | 3806776850122 |
10 | 1101000111023 |
11 | 394a2795022a |
12 | 15946a86203b |
13 | 7ca93053b47 |
14 | 3b408243731 |
15 | 1d98d6a51b8 |
hex | 10058b873af |
1101000111023 has 2 divisors, whose sum is σ = 1101000111024. Its totient is φ = 1101000111022.
The previous prime is 1101000110983. The next prime is 1101000111041. The reversal of 1101000111023 is 3201110001011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1101000111023 - 210 = 1101000109999 is a prime.
It is a super-2 number, since 2×11010001110232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1101000110995 and 1101000111013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101000113023) 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, 550500055511 + 550500055512.
It is an arithmetic number, because the mean of its divisors is an integer number (550500055512).
Almost surely, 21101000111023 is an apocalyptic number.
1101000111023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101000111023 is an equidigital number, since it uses as much as digits as its factorization.
1101000111023 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 11.
Adding to 1101000111023 its reverse (3201110001011), we get a palindrome (4302110112034).
The spelling of 1101000111023 in words is "one trillion, one hundred one billion, one hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •