Base | Representation |
---|---|
bin | 10000001110111111100… |
… | …11010011100110110101 |
3 | 1222022210102112220112000 |
4 | 20013133303103212311 |
5 | 33114341210100010 |
6 | 1104130300445513 |
7 | 55204640641554 |
oct | 10073763234665 |
9 | 1868712486460 |
10 | 557805550005 |
11 | 1a5622766820 |
12 | 90133b49899 |
13 | 407a706a832 |
14 | 1cdd8481d9b |
15 | e79a8b37c0 |
hex | 81dfcd39b5 |
557805550005 has 32 divisors (see below), whose sum is σ = 1081804705920. Its totient is φ = 270451175040.
The previous prime is 557805549971. The next prime is 557805550033. The reversal of 557805550005 is 500055508755.
It is a happy number.
It is not a de Polignac number, because 557805550005 - 27 = 557805549877 is a prime.
It is a super-2 number, since 2×5578055500052 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent 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, 187811832 + ... + 187814801.
It is an arithmetic number, because the mean of its divisors is an integer number (33806397060).
Almost surely, 2557805550005 is an apocalyptic number.
557805550005 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
557805550005 is a deficient number, since it is larger than the sum of its proper divisors (523999155915).
557805550005 is a wasteful number, since it uses less digits than its factorization.
557805550005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 375626658 (or 375626652 counting only the distinct ones).
The product of its (nonzero) digits is 875000, while the sum is 45.
The spelling of 557805550005 in words is "five hundred fifty-seven billion, eight hundred five million, five hundred fifty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •