Base | Representation |
---|---|
bin | 111101100101001101… |
… | …010110011000010101 |
3 | 20022200012011102112021 |
4 | 331211031112120111 |
5 | 2040404330222142 |
6 | 50213134453141 |
7 | 4530402020443 |
oct | 754515263025 |
9 | 208605142467 |
10 | 66122507797 |
11 | 26051482865 |
12 | 109943641b1 |
13 | 630a01a478 |
14 | 32b3a71b93 |
15 | 1abeed9267 |
hex | f65356615 |
66122507797 has 2 divisors, whose sum is σ = 66122507798. Its totient is φ = 66122507796.
The previous prime is 66122507779. The next prime is 66122507809. The reversal of 66122507797 is 79770522166.
Together with previous prime (66122507779) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61142947441 + 4979560356 = 247271^2 + 70566^2 .
It is a cyclic number.
It is not a de Polignac number, because 66122507797 - 27 = 66122507669 is a prime.
It is a super-3 number, since 3×661225077973 (a number of 33 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (66122507197) 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, 33061253898 + 33061253899.
It is an arithmetic number, because the mean of its divisors is an integer number (33061253899).
Almost surely, 266122507797 is an apocalyptic number.
It is an amenable number.
66122507797 is a deficient number, since it is larger than the sum of its proper divisors (1).
66122507797 is an equidigital number, since it uses as much as digits as its factorization.
66122507797 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2222640, while the sum is 52.
The spelling of 66122507797 in words is "sixty-six billion, one hundred twenty-two million, five hundred seven thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •