Base | Representation |
---|---|
bin | 10000001101100101011… |
… | …101010000100110011101 |
3 | 10221111200110020212101221 |
4 | 100031211131100212131 |
5 | 121223133231324103 |
6 | 2211450533333341 |
7 | 143330255455153 |
oct | 20154535204635 |
9 | 3844613225357 |
10 | 1114098698653 |
11 | 39a539741a66 |
12 | 15bb05497251 |
13 | 8109c993505 |
14 | 3bccbb133d3 |
15 | 1dea85cd1bd |
hex | 1036575099d |
1114098698653 has 2 divisors, whose sum is σ = 1114098698654. Its totient is φ = 1114098698652.
The previous prime is 1114098698611. The next prime is 1114098698663. The reversal of 1114098698653 is 3568968904111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1020831371044 + 93267327609 = 1010362^2 + 305397^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1114098698653 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1114098698591 and 1114098698600.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1114098698663) 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, 557049349326 + 557049349327.
It is an arithmetic number, because the mean of its divisors is an integer number (557049349327).
Almost surely, 21114098698653 is an apocalyptic number.
It is an amenable number.
1114098698653 is a deficient number, since it is larger than the sum of its proper divisors (1).
1114098698653 is an equidigital number, since it uses as much as digits as its factorization.
1114098698653 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11197440, while the sum is 61.
The spelling of 1114098698653 in words is "one trillion, one hundred fourteen billion, ninety-eight million, six hundred ninety-eight thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •