Base | Representation |
---|---|
bin | 110001001001111100… |
… | …1010111111100000001 |
3 | 101002110200201022122120 |
4 | 1202103321113330001 |
5 | 3212141442143423 |
6 | 120254355554453 |
7 | 10424613332406 |
oct | 1422371277401 |
9 | 332420638576 |
10 | 105560506113 |
11 | 4084a1766a7 |
12 | 1855bbbba29 |
13 | 9c5381984a |
14 | 51757482ad |
15 | 2b2c4abee3 |
hex | 1893e57f01 |
105560506113 has 32 divisors (see below), whose sum is σ = 145297152000. Its totient is φ = 68130160896.
The previous prime is 105560506111. The next prime is 105560506157. The reversal of 105560506113 is 311605065501.
It is not a de Polignac number, because 105560506113 - 21 = 105560506111 is a prime.
It is a super-2 number, since 2×1055605061132 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105560506111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7727113 + ... + 7740761.
It is an arithmetic number, because the mean of its divisors is an integer number (4540536000).
Almost surely, 2105560506113 is an apocalyptic number.
It is an amenable number.
105560506113 is a deficient number, since it is larger than the sum of its proper divisors (39736645887).
105560506113 is a wasteful number, since it uses less digits than its factorization.
105560506113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14221.
The product of its (nonzero) digits is 13500, while the sum is 33.
The spelling of 105560506113 in words is "one hundred five billion, five hundred sixty million, five hundred six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •