Base | Representation |
---|---|
bin | 10000001011110111100… |
… | …01011101101011111000 |
3 | 1222011110110201021120220 |
4 | 20011323301131223320 |
5 | 33102422100023100 |
6 | 1103251551020040 |
7 | 55115232304014 |
oct | 10057361355370 |
9 | 1864413637526 |
10 | 556127345400 |
11 | 1a494142a870 |
12 | 8b945b0a620 |
13 | 4059a482963 |
14 | 1ccb9631544 |
15 | e6ed3b7aa0 |
hex | 817bc5daf8 |
556127345400 has 384 divisors, whose sum is σ = 1971259545600. Its totient is φ = 128381017600.
The previous prime is 556127345381. The next prime is 556127345401. The reversal of 556127345400 is 4543721655.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (556127345401) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 34450531 + ... + 34466669.
It is an arithmetic number, because the mean of its divisors is an integer number (5133488400).
Almost surely, 2556127345400 is an apocalyptic number.
556127345400 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 556127345400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (985629772800).
556127345400 is an abundant number, since it is smaller than the sum of its proper divisors (1415132200200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
556127345400 is a wasteful number, since it uses less digits than its factorization.
556127345400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16419 (or 16410 counting only the distinct ones).
The product of its (nonzero) digits is 504000, while the sum is 42.
The spelling of 556127345400 in words is "five hundred fifty-six billion, one hundred twenty-seven million, three hundred forty-five thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •