Base | Representation |
---|---|
bin | 10000000001011111010… |
… | …10110100000110100100 |
3 | 1221122002011102120211102 |
4 | 20000233222310012210 |
5 | 33010014211112000 |
6 | 1100531032255232 |
7 | 54530165046452 |
oct | 10005752640644 |
9 | 1848064376742 |
10 | 550555566500 |
11 | 1a254229a915 |
12 | 8a84bb41518 |
13 | 3cbc0029874 |
14 | 1c90b6519d2 |
15 | e4c416a3d5 |
hex | 802fab41a4 |
550555566500 has 96 divisors (see below), whose sum is σ = 1214345932800. Its totient is φ = 218039817600.
The previous prime is 550555566347. The next prime is 550555566511. The reversal of 550555566500 is 5665555055.
It is a super-2 number, since 2×5505555665002 (a number of 24 digits) contains 22 as substring.
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, 95862629 + ... + 95868371.
It is an arithmetic number, because the mean of its divisors is an integer number (12649436800).
Almost surely, 2550555566500 is an apocalyptic number.
550555566500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 550555566500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (607172966400).
550555566500 is an abundant number, since it is smaller than the sum of its proper divisors (663790366300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
550555566500 is a wasteful number, since it uses less digits than its factorization.
550555566500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7630 (or 7618 counting only the distinct ones).
The product of its (nonzero) digits is 2812500, while the sum is 47.
The spelling of 550555566500 in words is "five hundred fifty billion, five hundred fifty-five million, five hundred sixty-six thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •