Base | Representation |
---|---|
bin | 11110000100110000110000… |
… | …01011000110000111100101 |
3 | 22200011101012220121212210000 |
4 | 33002120120023012013211 |
5 | 32132021032332020022 |
6 | 352353403345251513 |
7 | 16634021621456640 |
oct | 1702303013060745 |
9 | 280141186555700 |
10 | 66134311985637 |
11 | 1a088449aa8285 |
12 | 7501333333b99 |
13 | 2ab959223a8ac |
14 | 1248cbc558a57 |
15 | 79a48a1ee6ac |
hex | 3c26182c61e5 |
66134311985637 has 80 divisors (see below), whose sum is σ = 115315270912512. Its totient is φ = 36984900775680.
The previous prime is 66134311985579. The next prime is 66134311985659. The reversal of 66134311985637 is 73658911343166.
66134311985637 is a `hidden beast` number, since 6 + 6 + 1 + 3 + 431 + 198 + 5 + 6 + 3 + 7 = 666.
It is not a de Polignac number, because 66134311985637 - 28 = 66134311985381 is a prime.
It is a Smith number, since the sum of its digits (63) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66134311985437) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 561195673 + ... + 561313505.
Almost surely, 266134311985637 is an apocalyptic number.
It is an amenable number.
66134311985637 is a deficient number, since it is larger than the sum of its proper divisors (49180958926875).
66134311985637 is a wasteful number, since it uses less digits than its factorization.
66134311985637 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 138960 (or 138951 counting only the distinct ones).
The product of its digits is 58786560, while the sum is 63.
The spelling of 66134311985637 in words is "sixty-six trillion, one hundred thirty-four billion, three hundred eleven million, nine hundred eighty-five thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •