Base | Representation |
---|---|
bin | 11110010111001010111000… |
… | …00001001101010011001000 |
3 | 22202101211210211001022022220 |
4 | 33023211130001031103020 |
5 | 32222401411432434213 |
6 | 354000125502214040 |
7 | 20030512542552006 |
oct | 1713453401152310 |
9 | 282354724038286 |
10 | 66766810436808 |
11 | 1a301710980189 |
12 | 75a3a31884320 |
13 | 2b34110a69661 |
14 | 126b7609b3a76 |
15 | 7abb581b7e23 |
hex | 3cb95c04d4c8 |
66766810436808 has 96 divisors (see below), whose sum is σ = 171768269786400. Its totient is φ = 21626577566208.
The previous prime is 66766810436797. The next prime is 66766810436813. The reversal of 66766810436808 is 80863401866766.
It is a super-2 number, since 2×667668104368082 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 24566628 + ... + 27148716.
It is an arithmetic number, because the mean of its divisors is an integer number (1789252810275).
Almost surely, 266766810436808 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 66766810436808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85884134893200).
66766810436808 is an abundant number, since it is smaller than the sum of its proper divisors (105001459349592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66766810436808 is a wasteful number, since it uses less digits than its factorization.
66766810436808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2582959 (or 2582918 counting only the distinct ones).
The product of its (nonzero) digits is 334430208, while the sum is 69.
The spelling of 66766810436808 in words is "sixty-six trillion, seven hundred sixty-six billion, eight hundred ten million, four hundred thirty-six thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •