Base | Representation |
---|---|
bin | 10011010111100101110… |
… | …01000011010001111100 |
3 | 2100121202211200002101212 |
4 | 21223302321003101330 |
5 | 41400421000134000 |
6 | 1225420530423552 |
7 | 66036465466121 |
oct | 11536271032174 |
9 | 2317684602355 |
10 | 665500005500 |
11 | 237267449150 |
12 | a8b8a731bb8 |
13 | 4a9aaa00a05 |
14 | 242d3392748 |
15 | 124a0391c35 |
hex | 9af2e4347c |
665500005500 has 96 divisors (see below), whose sum is σ = 1586429627328. Its totient is φ = 241870944000.
The previous prime is 665500005473. The next prime is 665500005551. The reversal of 665500005500 is 5500005566.
It is a zygodrome in base 10.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10600202 + ... + 10662798.
It is an arithmetic number, because the mean of its divisors is an integer number (16525308618).
It is the magic constant of a 11000 × 11000 magic square.
Almost surely, 2665500005500 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 665500005500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (793214813664).
665500005500 is an abundant number, since it is smaller than the sum of its proper divisors (920929621828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
665500005500 is a wasteful number, since it uses less digits than its factorization.
665500005500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64560 (or 64548 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 32.
It can be divided in two parts, 66550000 and 5500, that multiplied together give a square (366025000000 = 6050002).
The spelling of 665500005500 in words is "six hundred sixty-five billion, five hundred million, five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •