Base | Representation |
---|---|
bin | 10011001110010010101… |
… | …00111011111011101010 |
3 | 2100010212220202221122210 |
4 | 21213021110323323222 |
5 | 41310204433030231 |
6 | 1223233312225550 |
7 | 65501665600266 |
oct | 11471124737352 |
9 | 2303786687583 |
10 | 660507705066 |
11 | 23513541aa20 |
12 | a801683b2b6 |
13 | 4a3936398a1 |
14 | 23d7c3370a6 |
15 | 122abe5ba46 |
hex | 99c953beea |
660507705066 has 64 divisors (see below), whose sum is σ = 1477188461952. Its totient is φ = 195148800000.
The previous prime is 660507705007. The next prime is 660507705079.
660507705066 is nontrivially palindromic in base 10.
It is a Curzon number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 4256076 + ... + 4408536.
It is an arithmetic number, because the mean of its divisors is an integer number (23081069718).
Almost surely, 2660507705066 is an apocalyptic number.
660507705066 is a gapful number since it is divisible by the number (66) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 660507705066, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (738594230976).
660507705066 is an abundant number, since it is smaller than the sum of its proper divisors (816680756886).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
660507705066 is a wasteful number, since it uses less digits than its factorization.
660507705066 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154119.
The product of its (nonzero) digits is 1587600, while the sum is 48.
The spelling of 660507705066 in words is "six hundred sixty billion, five hundred seven million, seven hundred five thousand, sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •