Base | Representation |
---|---|
bin | 1001001100001110001001… |
… | …0110001100101011011111 |
3 | 1022210002012220000210211111 |
4 | 2103003202112030223133 |
5 | 2311032142000100421 |
6 | 33254232550002451 |
7 | 2062050132252205 |
oct | 223034226145337 |
9 | 38702186023744 |
10 | 10105560550111 |
11 | 324682052a784 |
12 | 1172637946427 |
13 | 583c4798c0b0 |
14 | 26d17c889075 |
15 | 127d0740cee1 |
hex | 930e258cadf |
10105560550111 has 32 divisors (see below), whose sum is σ = 11078673655616. Its totient is φ = 9160905600000.
The previous prime is 10105560550091. The next prime is 10105560550121. The reversal of 10105560550111 is 11105506550101.
10105560550111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10105560550111 - 29 = 10105560549599 is a prime.
It is a super-3 number, since 3×101055605501113 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10105560550121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1981091461 + ... + 1981096561.
It is an arithmetic number, because the mean of its divisors is an integer number (346208551738).
Almost surely, 210105560550111 is an apocalyptic number.
10105560550111 is a deficient number, since it is larger than the sum of its proper divisors (973113105505).
10105560550111 is a wasteful number, since it uses less digits than its factorization.
10105560550111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8603.
The product of its (nonzero) digits is 3750, while the sum is 31.
The spelling of 10105560550111 in words is "ten trillion, one hundred five billion, five hundred sixty million, five hundred fifty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •