Base | Representation |
---|---|
bin | 10011001101011110000… |
… | …00101110101111011101 |
3 | 2100002202011000012022100 |
4 | 21212233000232233131 |
5 | 41303303421404131 |
6 | 1223121421235313 |
7 | 65455025063136 |
oct | 11465700565735 |
9 | 2302664005270 |
10 | 660066200541 |
11 | 234a29187050 |
12 | a7b12a02b39 |
13 | 4a3230259c7 |
14 | 23d3984ac8d |
15 | 122832ea7e6 |
hex | 99af02ebdd |
660066200541 has 12 divisors (see below), whose sum is σ = 1040104316160. Its totient is φ = 400040121480.
The previous prime is 660066200533. The next prime is 660066200581. The reversal of 660066200541 is 145002660066.
It is a happy number.
660066200541 is a `hidden beast` number, since 6 + 600 + 6 + 6 + 2 + 0 + 0 + 5 + 41 = 666.
It is not a de Polignac number, because 660066200541 - 23 = 660066200533 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 660066200496 and 660066200505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (660066200501) 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 in 11 ways as a sum of consecutive naturals, for example, 3333667581 + ... + 3333667778.
It is an arithmetic number, because the mean of its divisors is an integer number (86675359680).
Almost surely, 2660066200541 is an apocalyptic number.
It is an amenable number.
660066200541 is a deficient number, since it is larger than the sum of its proper divisors (380038115619).
660066200541 is a wasteful number, since it uses less digits than its factorization.
660066200541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6667335376 (or 6667335373 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The spelling of 660066200541 in words is "six hundred sixty billion, sixty-six million, two hundred thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •