Base | Representation |
---|---|
bin | 1001100110000110001110… |
… | …0101111001111101101001 |
3 | 1101100120200100022011122110 |
4 | 2121201203211321331221 |
5 | 2340323111300410410 |
6 | 34234353123312533 |
7 | 2136135401063244 |
oct | 231414345717551 |
9 | 41316610264573 |
10 | 10550110560105 |
11 | 33a8305408a56 |
12 | 122482281b749 |
13 | 5b6b42c1629c |
14 | 2868b162225b |
15 | 134674ea9720 |
hex | 99863979f69 |
10550110560105 has 64 divisors (see below), whose sum is σ = 17774134640640. Its totient is φ = 5333359680000.
The previous prime is 10550110560047. The next prime is 10550110560109. The reversal of 10550110560105 is 50106501105501.
It is not a de Polignac number, because 10550110560105 - 210 = 10550110559081 is a prime.
It is a super-2 number, since 2×105501105601052 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10550110560109) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 21059280 + ... + 21554430.
It is an arithmetic number, because the mean of its divisors is an integer number (277720853760).
Almost surely, 210550110560105 is an apocalyptic number.
10550110560105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10550110560105 is a deficient number, since it is larger than the sum of its proper divisors (7224024080535).
10550110560105 is a wasteful number, since it uses less digits than its factorization.
10550110560105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 495742.
The product of its (nonzero) digits is 3750, while the sum is 30.
Adding to 10550110560105 its reverse (50106501105501), we get a palindrome (60656611665606).
The spelling of 10550110560105 in words is "ten trillion, five hundred fifty billion, one hundred ten million, five hundred sixty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •