Base | Representation |
---|---|
bin | 110000110101000110110… |
… | …1011100011100111101001 |
3 | 212202120120012121021211011 |
4 | 1201222031223203213221 |
5 | 1334423331134000042 |
6 | 22135013305103521 |
7 | 1261601465055232 |
oct | 141521553434751 |
9 | 25676505537734 |
10 | 6711115921897 |
11 | 2158193a85762 |
12 | 9047ab187ba1 |
13 | 398b17750cca |
14 | 192b6953c089 |
15 | b9888d7ba17 |
hex | 61a8dae39e9 |
6711115921897 has 2 divisors, whose sum is σ = 6711115921898. Its totient is φ = 6711115921896.
The previous prime is 6711115921879. The next prime is 6711115921927. The reversal of 6711115921897 is 7981295111176.
Together with previous prime (6711115921879) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5061730529241 + 1649385392656 = 2249829^2 + 1284284^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6711115921897 is a prime.
It is not a weakly prime, because it can be changed into another prime (6711115921817) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3355557960948 + 3355557960949.
It is an arithmetic number, because the mean of its divisors is an integer number (3355557960949).
Almost surely, 26711115921897 is an apocalyptic number.
It is an amenable number.
6711115921897 is a deficient number, since it is larger than the sum of its proper divisors (1).
6711115921897 is an equidigital number, since it uses as much as digits as its factorization.
6711115921897 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1905120, while the sum is 58.
The spelling of 6711115921897 in words is "six trillion, seven hundred eleven billion, one hundred fifteen million, nine hundred twenty-one thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •