Base | Representation |
---|---|
bin | 10110110111010110101110… |
… | …111110110011011101101100 |
3 | 111012001112112100012100212021 |
4 | 112313112232332303131230 |
5 | 101140042414240004211 |
6 | 553513030554515524 |
7 | 30116202310025242 |
oct | 2667265676633554 |
9 | 435045470170767 |
10 | 100561005000556 |
11 | 2a050756780501 |
12 | b341491135ba4 |
13 | 4415b28cbc189 |
14 | 1ab9270178792 |
15 | b95c50ec3771 |
hex | 5b75aefb376c |
100561005000556 has 12 divisors (see below), whose sum is σ = 176017754235960. Its totient is φ = 50270218076000.
The previous prime is 100561005000553. The next prime is 100561005000569. The reversal of 100561005000556 is 655000500165001.
It is a super-2 number, since 2×1005610050005562 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100561005000551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2571084070 + ... + 2571123181.
It is an arithmetic number, because the mean of its divisors is an integer number (14668146186330).
Almost surely, 2100561005000556 is an apocalyptic number.
It is an amenable number.
100561005000556 is a deficient number, since it is larger than the sum of its proper divisors (75456749235404).
100561005000556 is a wasteful number, since it uses less digits than its factorization.
100561005000556 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5142212144 (or 5142212142 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 34.
Adding to 100561005000556 its reverse (655000500165001), we get a palindrome (755561505165557).
The spelling of 100561005000556 in words is "one hundred trillion, five hundred sixty-one billion, five million, five hundred fifty-six", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •