Base | Representation |
---|---|
bin | 111110000101011100… |
… | …001011100110000000 |
3 | 20101001212200211021100 |
4 | 332011130023212000 |
5 | 2043011244013223 |
6 | 50342533054400 |
7 | 4546656263124 |
oct | 760534134600 |
9 | 211055624240 |
10 | 66663266688 |
11 | 262a9748a37 |
12 | 10b05487400 |
13 | 6395073645 |
14 | 33257d7584 |
15 | 1b02704043 |
hex | f8570b980 |
66663266688 has 192 divisors, whose sum is σ = 194225850000. Its totient is φ = 21944991744.
The previous prime is 66663266687. The next prime is 66663266737. The reversal of 66663266688 is 88666236666.
It is a tau number, because it is divible by the number of its divisors (192).
It is a super-2 number, since 2×666632666882 (a number of 22 digits) contains 22 as substring.
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66663266687) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 53372688 + ... + 53373936.
Almost surely, 266663266688 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 66663266688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (97112925000).
66663266688 is an abundant number, since it is smaller than the sum of its proper divisors (127562583312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66663266688 is a wasteful number, since it uses less digits than its factorization.
66663266688 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1809 (or 1794 counting only the distinct ones).
The product of its digits is 107495424, while the sum is 63.
The spelling of 66663266688 in words is "sixty-six billion, six hundred sixty-three million, two hundred sixty-six thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •