Base | Representation |
---|---|
bin | 11110000011000111001111… |
… | …10110010100000000010011 |
3 | 22122221222000012110000000110 |
4 | 33001203213312110000103 |
5 | 32130104030131000100 |
6 | 352311354435252403 |
7 | 16626645115224051 |
oct | 1701434766240023 |
9 | 278858005400013 |
10 | 66077666656275 |
11 | 1a06642120599a |
12 | 74b2364a4a103 |
13 | 2ab41357c5021 |
14 | 12462674331d1 |
15 | 798c7224d250 |
hex | 3c18e7d94013 |
66077666656275 has 12 divisors (see below), whose sum is σ = 109248408871832. Its totient is φ = 35241422216640.
The previous prime is 66077666656241. The next prime is 66077666656279. The reversal of 66077666656275 is 57265666677066.
It is not a de Polignac number, because 66077666656275 - 216 = 66077666590739 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (75), and also a Moran number because the ratio is a prime number: 881035555417 = 66077666656275 / (6 + 6 + 0 + 7 + 7 + 6 + 6 + 6 + 6 + 5 + 6 + 2 + 7 + 5).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 66077666656197 and 66077666656206.
It is not an unprimeable number, because it can be changed into a prime (66077666656279) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 440517777634 + ... + 440517777783.
Almost surely, 266077666656275 is an apocalyptic number.
66077666656275 is a deficient number, since it is larger than the sum of its proper divisors (43170742215557).
66077666656275 is a wasteful number, since it uses less digits than its factorization.
66077666656275 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 881035555430 (or 881035555425 counting only the distinct ones).
The product of its (nonzero) digits is 4800902400, while the sum is 75.
The spelling of 66077666656275 in words is "sixty-six trillion, seventy-seven billion, six hundred sixty-six million, six hundred fifty-six thousand, two hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •