Base | Representation |
---|---|
bin | 10000010000101001110… |
… | …010010111001011101101 |
3 | 10221211012000020121112211 |
4 | 100100221302113023231 |
5 | 121301404444034343 |
6 | 2213153440330421 |
7 | 143505013043026 |
oct | 20205162271355 |
9 | 3854160217484 |
10 | 1117392564973 |
11 | 3a0979a77533 |
12 | 160684613a11 |
13 | 814a6208a39 |
14 | 3c121373c4d |
15 | 1e0ec86d79d |
hex | 10429c972ed |
1117392564973 has 2 divisors, whose sum is σ = 1117392564974. Its totient is φ = 1117392564972.
The previous prime is 1117392564917. The next prime is 1117392564979. The reversal of 1117392564973 is 3794652937111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 847701379849 + 269691185124 = 920707^2 + 519318^2 .
It is a cyclic number.
It is not a de Polignac number, because 1117392564973 - 225 = 1117359010541 is a prime.
It is a super-2 number, since 2×11173925649732 (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 (1117392564979) 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, 558696282486 + 558696282487.
It is an arithmetic number, because the mean of its divisors is an integer number (558696282487).
Almost surely, 21117392564973 is an apocalyptic number.
It is an amenable number.
1117392564973 is a deficient number, since it is larger than the sum of its proper divisors (1).
1117392564973 is an equidigital number, since it uses as much as digits as its factorization.
1117392564973 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8573040, while the sum is 58.
The spelling of 1117392564973 in words is "one trillion, one hundred seventeen billion, three hundred ninety-two million, five hundred sixty-four thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •