Base | Representation |
---|---|
bin | 10000000000011101110… |
… | …100110011111001110001 |
3 | 10220011022201122222220002 |
4 | 100000131310303321301 |
5 | 121010311033323441 |
6 | 2201201042555345 |
7 | 142321215551252 |
oct | 20003564637161 |
9 | 3804281588802 |
10 | 1100012011121 |
11 | 394570115141 |
12 | 159233968b55 |
13 | 7c96642234a |
14 | 3b352d12b29 |
15 | 1d931a74b9b |
hex | 1001dd33e71 |
1100012011121 has 2 divisors, whose sum is σ = 1100012011122. Its totient is φ = 1100012011120.
The previous prime is 1100012011073. The next prime is 1100012011193. The reversal of 1100012011121 is 1211102100011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 825619380496 + 274392630625 = 908636^2 + 523825^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100012011121 - 226 = 1099944902257 is a prime.
It is a super-2 number, since 2×11000120111212 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1100012011421) 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, 550006005560 + 550006005561.
It is an arithmetic number, because the mean of its divisors is an integer number (550006005561).
Almost surely, 21100012011121 is an apocalyptic number.
It is an amenable number.
1100012011121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100012011121 is an equidigital number, since it uses as much as digits as its factorization.
1100012011121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1100012011121 its reverse (1211102100011), we get a palindrome (2311114111132).
The spelling of 1100012011121 in words is "one trillion, one hundred billion, twelve million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •