Base | Representation |
---|---|
bin | 111111001110011111011001… |
… | …0010000010010011000100000 |
3 | 2200221010222112121022010112012 |
4 | 1332130332302100102120200 |
5 | 1040343341310220334300 |
6 | 5250453402420052052 |
7 | 225100115660203556 |
oct | 17634766220223040 |
9 | 2627128477263465 |
10 | 556145420871200 |
11 | 151228a48445196 |
12 | 52460860234028 |
13 | 1ab42399105724 |
14 | 9b49820dbbbd6 |
15 | 44469430a6435 |
hex | 1f9cfb2412620 |
556145420871200 has 72 divisors (see below), whose sum is σ = 1429147377619920. Its totient is φ = 210749843692800.
The previous prime is 556145420871169. The next prime is 556145420871211. The reversal of 556145420871200 is 2178024541655.
It is a Harshad number since it is a multiple of its sum of digits (50).
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 11 ways as a sum of consecutive naturals, for example, 18294242066 + ... + 18294272465.
It is an arithmetic number, because the mean of its divisors is an integer number (19849269133610).
Almost surely, 2556145420871200 is an apocalyptic number.
556145420871200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
556145420871200 is an abundant number, since it is smaller than the sum of its proper divisors (873001956748720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
556145420871200 is a wasteful number, since it uses less digits than its factorization.
556145420871200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36588514570 (or 36588514557 counting only the distinct ones).
The product of its (nonzero) digits is 2688000, while the sum is 50.
The spelling of 556145420871200 in words is "five hundred fifty-six trillion, one hundred forty-five billion, four hundred twenty million, eight hundred seventy-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •