Base | Representation |
---|---|
bin | 111101110001001011… |
… | …100101001110000000 |
3 | 20100012012010022212201 |
4 | 331301023211032000 |
5 | 2041312240332010 |
6 | 50245112002544 |
7 | 4535361231214 |
oct | 756113451600 |
9 | 210165108781 |
10 | 66323370880 |
11 | 261448a5208 |
12 | 10a2b690454 |
13 | 633c817570 |
14 | 32d25da944 |
15 | 1ad296423a |
hex | f712e5380 |
66323370880 has 128 divisors (see below), whose sum is σ = 171507883680. Its totient is φ = 24380055552.
The previous prime is 66323370877. The next prime is 66323370899. The reversal of 66323370880 is 8807332366.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (128).
It is a self number, because there is not a number n which added to its sum of digits gives 66323370880.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1871082 + ... + 1906198.
Almost surely, 266323370880 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 66323370880, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85753941840).
66323370880 is an abundant number, since it is smaller than the sum of its proper divisors (105184512800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
66323370880 is a wasteful number, since it uses less digits than its factorization.
66323370880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35376 (or 35364 counting only the distinct ones).
The product of its (nonzero) digits is 870912, while the sum is 46.
The spelling of 66323370880 in words is "sixty-six billion, three hundred twenty-three million, three hundred seventy thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •