Base | Representation |
---|---|
bin | 11110010000101110010111… |
… | …00100010111110001000111 |
3 | 22201121200011102011122212001 |
4 | 33020113023210113301013 |
5 | 32210234330432020221 |
6 | 353310301524010131 |
7 | 20005512435664444 |
oct | 1710271344276107 |
9 | 281550142148761 |
10 | 66545343626311 |
11 | 1a2267a3709590 |
12 | 7568b24b30947 |
13 | 2b19278201264 |
14 | 1260b518a69cb |
15 | 7a5ee5337391 |
hex | 3c85cb917c47 |
66545343626311 has 16 divisors (see below), whose sum is σ = 72830372659200. Its totient is φ = 60299567490400.
The previous prime is 66545343626263. The next prime is 66545343626341. The reversal of 66545343626311 is 11362634354566.
It is a cyclic number.
It is not a de Polignac number, because 66545343626311 - 27 = 66545343626183 is a prime.
It is a super-2 number, since 2×665453436263112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66545343626341) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 132035130 + ... + 132538168.
It is an arithmetic number, because the mean of its divisors is an integer number (4551898291200).
Almost surely, 266545343626311 is an apocalyptic number.
66545343626311 is a deficient number, since it is larger than the sum of its proper divisors (6285029032889).
66545343626311 is a wasteful number, since it uses less digits than its factorization.
66545343626311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 542030.
The product of its digits is 27993600, while the sum is 55.
It can be divided in two parts, 6654534 and 3626311, that added together give a triangular number (10280845 = T4534).
The spelling of 66545343626311 in words is "sixty-six trillion, five hundred forty-five billion, three hundred forty-three million, six hundred twenty-six thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •