Base | Representation |
---|---|
bin | 10110110111010110101111… |
… | …010010010011000001011000 |
3 | 111012001112112200210222110101 |
4 | 112313112233102103001120 |
5 | 101140042422042014202 |
6 | 553513031300225144 |
7 | 30116202401330215 |
oct | 2667265722230130 |
9 | 435045480728411 |
10 | 100561010110552 |
11 | 2a050759650742 |
12 | b34149299b1b4 |
13 | 4415b2a08b044 |
14 | 1ab9270b08b0c |
15 | b95c51682887 |
hex | 5b75af493058 |
100561010110552 has 32 divisors (see below), whose sum is σ = 193151512325520. Its totient is φ = 49053950210560.
The previous prime is 100561010110541. The next prime is 100561010110571. The reversal of 100561010110552 is 255011010165001.
It is a super-2 number, since 2×1005610101105522 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 100561010110552.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 108215883 + ... + 109141189.
Almost surely, 2100561010110552 is an apocalyptic number.
It is an amenable number.
100561010110552 is a deficient number, since it is larger than the sum of its proper divisors (92590502214968).
100561010110552 is a wasteful number, since it uses less digits than its factorization.
100561010110552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1256691 (or 1256687 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 28.
Adding to 100561010110552 its reverse (255011010165001), we get a palindrome (355572020275553).
The spelling of 100561010110552 in words is "one hundred trillion, five hundred sixty-one billion, ten million, one hundred ten thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •