Base | Representation |
---|---|
bin | 10001011011000010100… |
… | …011000101101010010001 |
3 | 11020110100110002221111101 |
4 | 101123002203011222101 |
5 | 124103444302331132 |
6 | 2314003233344401 |
7 | 152333224422655 |
oct | 21330243055221 |
9 | 4213313087441 |
10 | 1197264886417 |
11 | 4218368a7846 |
12 | 174055708101 |
13 | 88b94a588c2 |
14 | 41d3b194a65 |
15 | 21224a1b7e7 |
hex | 116c28c5a91 |
1197264886417 has 2 divisors, whose sum is σ = 1197264886418. Its totient is φ = 1197264886416.
The previous prime is 1197264886409. The next prime is 1197264886421. The reversal of 1197264886417 is 7146884627911.
It is a Cunningham number, because it is equal to 10941962+1.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1197264886416 + 1 = 1094196^2 + 1^2 .
It is a cyclic number.
It is not a de Polignac number, because 1197264886417 - 23 = 1197264886409 is a prime.
It is a super-2 number, since 2×11972648864172 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1197264886427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 598632443208 + 598632443209.
It is an arithmetic number, because the mean of its divisors is an integer number (598632443209).
Almost surely, 21197264886417 is an apocalyptic number.
It is an amenable number.
1197264886417 is a deficient number, since it is larger than the sum of its proper divisors (1).
1197264886417 is an equidigital number, since it uses as much as digits as its factorization.
1197264886417 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 32514048, while the sum is 64.
The spelling of 1197264886417 in words is "one trillion, one hundred ninety-seven billion, two hundred sixty-four million, eight hundred eighty-six thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •