Base | Representation |
---|---|
bin | 10000000001011111010… |
… | …001010011110111001001 |
3 | 10220021011020201122222111 |
4 | 100001133101103313021 |
5 | 121020033130013342 |
6 | 2201502024422321 |
7 | 142360350403231 |
oct | 20013721236711 |
9 | 3807136648874 |
10 | 1101110001097 |
11 | 394a83987277 |
12 | 15949b6179a1 |
13 | 7caaca4b162 |
14 | 3b418a8acc1 |
15 | 1d998160217 |
hex | 1005f453dc9 |
1101110001097 has 2 divisors, whose sum is σ = 1101110001098. Its totient is φ = 1101110001096.
The previous prime is 1101110001053. The next prime is 1101110001127. The reversal of 1101110001097 is 7901000111011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1041510055936 + 59599945161 = 1020544^2 + 244131^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101110001097 - 219 = 1101109476809 is a prime.
It is not a weakly prime, because it can be changed into another prime (1101110001697) 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, 550555000548 + 550555000549.
It is an arithmetic number, because the mean of its divisors is an integer number (550555000549).
Almost surely, 21101110001097 is an apocalyptic number.
It is an amenable number.
1101110001097 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101110001097 is an equidigital number, since it uses as much as digits as its factorization.
1101110001097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63, while the sum is 22.
The spelling of 1101110001097 in words is "one trillion, one hundred one billion, one hundred ten million, one thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.151 sec. • engine limits •