Base | Representation |
---|---|
bin | 111101100000111100… |
… | …011101111101101101 |
3 | 20022111012120002222200 |
4 | 331200330131331231 |
5 | 2040233022123144 |
6 | 50202101332113 |
7 | 4525543004001 |
oct | 754074357555 |
9 | 208435502880 |
10 | 66050973549 |
11 | 26015064050 |
12 | 10974407039 |
13 | 62c8262502 |
14 | 32a8370701 |
15 | 1ab8aa8c69 |
hex | f60f1df6d |
66050973549 has 24 divisors (see below), whose sum is σ = 104098254624. Its totient is φ = 40023996000.
The previous prime is 66050973523. The next prime is 66050973563. The reversal of 66050973549 is 94537905066.
66050973549 is a `hidden beast` number, since 6 + 6 + 0 + 5 + 0 + 97 + 3 + 549 = 666.
It is not a de Polignac number, because 66050973549 - 25 = 66050973517 is a prime.
It is a super-2 number, since 2×660509735492 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 66050973495 and 66050973504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66050973349) 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 23 ways as a sum of consecutive naturals, for example, 552559 + ... + 661379.
It is an arithmetic number, because the mean of its divisors is an integer number (4337427276).
Almost surely, 266050973549 is an apocalyptic number.
It is an amenable number.
66050973549 is a deficient number, since it is larger than the sum of its proper divisors (38047281075).
66050973549 is a wasteful number, since it uses less digits than its factorization.
66050973549 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114969 (or 114966 counting only the distinct ones).
The product of its (nonzero) digits is 6123600, while the sum is 54.
The spelling of 66050973549 in words is "sixty-six billion, fifty million, nine hundred seventy-three thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •