Base | Representation |
---|---|
bin | 10000001001001000110… |
… | …01010110001101101110 |
3 | 1222000200022021211011101 |
4 | 20010210121112031232 |
5 | 33041421304434200 |
6 | 1102450302513314 |
7 | 55034012104630 |
oct | 10044431261556 |
9 | 1860608254141 |
10 | 554661405550 |
11 | 1a42599a352a |
12 | 8b5b6b9583a |
13 | 403c5857725 |
14 | 1cbbaa76a50 |
15 | e66484a26a |
hex | 812465636e |
554661405550 has 48 divisors (see below), whose sum is σ = 1193976437760. Its totient is φ = 187762404960.
The previous prime is 554661405523. The next prime is 554661405553. The reversal of 554661405550 is 55504166455.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 554661405550.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (554661405553) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 10002394 + ... + 10057693.
It is an arithmetic number, because the mean of its divisors is an integer number (24874509120).
Almost surely, 2554661405550 is an apocalyptic number.
554661405550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
554661405550 is an abundant number, since it is smaller than the sum of its proper divisors (639315032210).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
554661405550 is a wasteful number, since it uses less digits than its factorization.
554661405550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20060185 (or 20060180 counting only the distinct ones).
The product of its (nonzero) digits is 1800000, while the sum is 46.
The spelling of 554661405550 in words is "five hundred fifty-four billion, six hundred sixty-one million, four hundred five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •