Base | Representation |
---|---|
bin | 10000001001111000000… |
… | …001111100001001100001 |
3 | 10221010101211212010012111 |
4 | 100021320001330021201 |
5 | 121142004011234201 |
6 | 2205551400155321 |
7 | 143126456446252 |
oct | 20117001741141 |
9 | 3833354763174 |
10 | 1110115336801 |
11 | 398885192279 |
12 | 15b193468b41 |
13 | 808b6648c73 |
14 | 3ba30a90b29 |
15 | 1dd23a42b51 |
hex | 1027807c261 |
1110115336801 has 2 divisors, whose sum is σ = 1110115336802. Its totient is φ = 1110115336800.
The previous prime is 1110115336769. The next prime is 1110115336823. The reversal of 1110115336801 is 1086335110111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1099100624400 + 11014712401 = 1048380^2 + 104951^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110115336801 - 25 = 1110115336769 is a prime.
It is a super-2 number, since 2×11101153368012 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1110115336861) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555057668400 + 555057668401.
It is an arithmetic number, because the mean of its divisors is an integer number (555057668401).
Almost surely, 21110115336801 is an apocalyptic number.
It is an amenable number.
1110115336801 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110115336801 is an equidigital number, since it uses as much as digits as its factorization.
1110115336801 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 31.
The spelling of 1110115336801 in words is "one trillion, one hundred ten billion, one hundred fifteen million, three hundred thirty-six thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •