Base | Representation |
---|---|
bin | 11110010110110101110000… |
… | …10101111001001000011101 |
3 | 22202100202112210102002012221 |
4 | 33023122320111321020131 |
5 | 32222210202430224323 |
6 | 353551012553025341 |
7 | 20026631613422326 |
oct | 1713327025711035 |
9 | 282322483362187 |
10 | 66755474461213 |
11 | 1a2a7924026a0a |
12 | 75a17a93b5251 |
13 | 2b330253593a5 |
14 | 126ada724744d |
15 | 7ab6e2db055d |
hex | 3cb6b857921d |
66755474461213 has 2 divisors, whose sum is σ = 66755474461214. Its totient is φ = 66755474461212.
The previous prime is 66755474461201. The next prime is 66755474461217. The reversal of 66755474461213 is 31216447455766.
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., 49473470252644 + 17282004208569 = 7033738^2 + 4157163^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-66755474461213 is a prime.
It is a super-2 number, since 2×667554744612132 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (66755474461217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33377737230606 + 33377737230607.
It is an arithmetic number, because the mean of its divisors is an integer number (33377737230607).
Almost surely, 266755474461213 is an apocalyptic number.
It is an amenable number.
66755474461213 is a deficient number, since it is larger than the sum of its proper divisors (1).
66755474461213 is an equidigital number, since it uses as much as digits as its factorization.
66755474461213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 101606400, while the sum is 61.
The spelling of 66755474461213 in words is "sixty-six trillion, seven hundred fifty-five billion, four hundred seventy-four million, four hundred sixty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •