Base | Representation |
---|---|
bin | 10000001001110001100… |
… | …000000111001010000001 |
3 | 10221010010012202100202221 |
4 | 100021301200013022001 |
5 | 121141242441240242 |
6 | 2205532444411041 |
7 | 143123656446505 |
oct | 20116140071201 |
9 | 3833105670687 |
10 | 1110005805697 |
11 | 3988293809a8 |
12 | 15b162846a81 |
13 | 80899a49169 |
14 | 3ba202dc305 |
15 | 1dd19109167 |
hex | 10271807281 |
1110005805697 has 2 divisors, whose sum is σ = 1110005805698. Its totient is φ = 1110005805696.
The previous prime is 1110005805641. The next prime is 1110005805719. The reversal of 1110005805697 is 7965085000111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1049198684416 + 60807121281 = 1024304^2 + 246591^2 .
It is a cyclic number.
It is not a de Polignac number, because 1110005805697 - 215 = 1110005772929 is a prime.
It is a super-2 number, since 2×11100058056972 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1110005805607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555002902848 + 555002902849.
It is an arithmetic number, because the mean of its divisors is an integer number (555002902849).
Almost surely, 21110005805697 is an apocalyptic number.
It is an amenable number.
1110005805697 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110005805697 is an equidigital number, since it uses as much as digits as its factorization.
1110005805697 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75600, while the sum is 43.
The spelling of 1110005805697 in words is "one trillion, one hundred ten billion, five million, eight hundred five thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •