Base | Representation |
---|---|
bin | 1001100110011110100011… |
… | …1111100001000111100111 |
3 | 1101101012112122101112211112 |
4 | 2121213220333201013213 |
5 | 2340430001231023421 |
6 | 34241353301255235 |
7 | 2136456320102213 |
oct | 231475077410747 |
9 | 41335478345745 |
10 | 10556643611111 |
11 | 340005811a964 |
12 | 1225b4670451b |
13 | 5b7644569a40 |
14 | 286d3114b943 |
15 | 1349087d845b |
hex | 999e8fe11e7 |
10556643611111 has 16 divisors (see below), whose sum is σ = 11742774290688. Its totient is φ = 9424346803200.
The previous prime is 10556643611071. The next prime is 10556643611161. The reversal of 10556643611111 is 11111634665501.
It is not a de Polignac number, because 10556643611111 - 210 = 10556643610087 is a prime.
It is a super-2 number, since 2×105566436111112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10556643611161) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7557770 + ... + 8844951.
It is an arithmetic number, because the mean of its divisors is an integer number (733923393168).
Almost surely, 210556643611111 is an apocalyptic number.
10556643611111 is a deficient number, since it is larger than the sum of its proper divisors (1186130679577).
10556643611111 is a wasteful number, since it uses less digits than its factorization.
10556643611111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16404362.
The product of its (nonzero) digits is 64800, while the sum is 41.
The spelling of 10556643611111 in words is "ten trillion, five hundred fifty-six billion, six hundred forty-three million, six hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •