Base | Representation |
---|---|
bin | 10000001001111101001… |
… | …100100100111000011001 |
3 | 10221010121212221122001222 |
4 | 100021331030210320121 |
5 | 121142143203324121 |
6 | 2210004134021425 |
7 | 143131561251215 |
oct | 20117514447031 |
9 | 3833555848058 |
10 | 1110202011161 |
11 | 39891a101a81 |
12 | 15b1b84a7875 |
13 | 808cb5a5279 |
14 | 3ba3c3b3945 |
15 | 1dd2b4640ab |
hex | 1027d324e19 |
1110202011161 has 2 divisors, whose sum is σ = 1110202011162. Its totient is φ = 1110202011160.
The previous prime is 1110202011097. The next prime is 1110202011173. The reversal of 1110202011161 is 1611102020111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 912657319561 + 197544691600 = 955331^2 + 444460^2 .
It is an emirp because it is prime and its reverse (1611102020111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1110202011161 - 26 = 1110202011097 is a prime.
It is not a weakly prime, because it can be changed into another prime (1110202011661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555101005580 + 555101005581.
It is an arithmetic number, because the mean of its divisors is an integer number (555101005581).
Almost surely, 21110202011161 is an apocalyptic number.
It is an amenable number.
1110202011161 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110202011161 is an equidigital number, since it uses as much as digits as its factorization.
1110202011161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 1110202011161 its reverse (1611102020111), we get a palindrome (2721304031272).
The spelling of 1110202011161 in words is "one trillion, one hundred ten billion, two hundred two million, eleven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •