Base | Representation |
---|---|
bin | 111111001101101011101011… |
… | …0001110110100000110110000 |
3 | 2200220202100212020212022000010 |
4 | 1332123113112032310012300 |
5 | 1040340031324430040440 |
6 | 5250330353443454520 |
7 | 225056104446434613 |
oct | 17633272616640660 |
9 | 2626670766768003 |
10 | 556034355315120 |
11 | 151195933876020 |
12 | 52443224687440 |
13 | 1ab34a78c27786 |
14 | 9b442c64a417a |
15 | 4443ae267d580 |
hex | 1f9b5d63b41b0 |
556034355315120 has 80 divisors (see below), whose sum is σ = 1880407092529152. Its totient is φ = 134796207348480.
The previous prime is 556034355315107. The next prime is 556034355315163. The reversal of 556034355315120 is 21513553430655.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×5560343553151202 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a self number, because there is not a number n which added to its sum of digits gives 556034355315120.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 105309534352 + ... + 105309539631.
Almost surely, 2556034355315120 is an apocalyptic number.
It is an amenable number.
556034355315120 is an abundant number, since it is smaller than the sum of its proper divisors (1324372737214032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
556034355315120 is a wasteful number, since it uses less digits than its factorization.
556034355315120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210619074010 (or 210619074004 counting only the distinct ones).
The product of its (nonzero) digits is 4050000, while the sum is 48.
The spelling of 556034355315120 in words is "five hundred fifty-six trillion, thirty-four billion, three hundred fifty-five million, three hundred fifteen thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •