Base | Representation |
---|---|
bin | 10000001011101110011… |
… | …00100010001001101100 |
3 | 1222011021010012221122112 |
4 | 20011313030202021230 |
5 | 33102242420234000 |
6 | 1103240205103152 |
7 | 55113310510526 |
oct | 10056714421154 |
9 | 1864233187575 |
10 | 556050555500 |
11 | 1a4902051440 |
12 | 8b924257ab8 |
13 | 405875a774b |
14 | 1ccad362a16 |
15 | e6e679a235 |
hex | 817732226c |
556050555500 has 96 divisors (see below), whose sum is σ = 1327895202816. Its totient is φ = 201730200000.
The previous prime is 556050555493. The next prime is 556050555517. The reversal of 556050555500 is 5555050655.
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 31 ways as a sum of consecutive naturals, for example, 2253215 + ... + 2487785.
It is an arithmetic number, because the mean of its divisors is an integer number (13832241696).
Almost surely, 2556050555500 is an apocalyptic number.
556050555500 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 556050555500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (663947601408).
556050555500 is an abundant number, since it is smaller than the sum of its proper divisors (771844647316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
556050555500 is a wasteful number, since it uses less digits than its factorization.
556050555500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235032 (or 235020 counting only the distinct ones).
The product of its (nonzero) digits is 468750, while the sum is 41.
The spelling of 556050555500 in words is "five hundred fifty-six billion, fifty million, five hundred fifty-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •