Base | Representation |
---|---|
bin | 10000010000101001110… |
… | …010010111001010110101 |
3 | 10221211012000020121110202 |
4 | 100100221302113022311 |
5 | 121301404444034132 |
6 | 2213153440330245 |
7 | 143505013042616 |
oct | 20205162271265 |
9 | 3854160217422 |
10 | 1117392564917 |
11 | 3a0979a77492 |
12 | 160684613985 |
13 | 814a62089c5 |
14 | 3c121373c0d |
15 | 1e0ec86d762 |
hex | 10429c972b5 |
1117392564917 has 2 divisors, whose sum is σ = 1117392564918. Its totient is φ = 1117392564916.
The previous prime is 1117392564907. The next prime is 1117392564973. The reversal of 1117392564917 is 7194652937111.
It is an a-pointer prime, because the next prime (1117392564973) can be obtained adding 1117392564917 to its sum of digits (56).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1036892121841 + 80500443076 = 1018279^2 + 283726^2 .
It is a cyclic number.
It is not a de Polignac number, because 1117392564917 - 24 = 1117392564901 is a prime.
It is a super-2 number, since 2×11173925649172 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1117392564907) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 558696282458 + 558696282459.
It is an arithmetic number, because the mean of its divisors is an integer number (558696282459).
Almost surely, 21117392564917 is an apocalyptic number.
It is an amenable number.
1117392564917 is a deficient number, since it is larger than the sum of its proper divisors (1).
1117392564917 is an equidigital number, since it uses as much as digits as its factorization.
1117392564917 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2857680, while the sum is 56.
The spelling of 1117392564917 in words is "one trillion, one hundred seventeen billion, three hundred ninety-two million, five hundred sixty-four thousand, nine hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •