Base | Representation |
---|---|
bin | 110001001001111011… |
… | …1101001111011010111 |
3 | 101002110122212102112121 |
4 | 1202103313221323113 |
5 | 3212141333234021 |
6 | 120254342200411 |
7 | 10424606444611 |
oct | 1422367517327 |
9 | 332418772477 |
10 | 105560055511 |
11 | 408499990a9 |
12 | 1855ba23107 |
13 | 9c536bc711 |
14 | 517566bdb1 |
15 | 2b2c41d741 |
hex | 1893de9ed7 |
105560055511 has 8 divisors (see below), whose sum is σ = 109337122944. Its totient is φ = 101806232160.
The previous prime is 105560055509. The next prime is 105560055521. The reversal of 105560055511 is 115550065501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105560055511 - 21 = 105560055509 is a prime.
It is a super-2 number, since 2×1055600555112 (a number of 23 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 (105560055521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5801776 + ... + 5819941.
It is an arithmetic number, because the mean of its divisors is an integer number (13667140368).
Almost surely, 2105560055511 is an apocalyptic number.
105560055511 is a deficient number, since it is larger than the sum of its proper divisors (3777067433).
105560055511 is a wasteful number, since it uses less digits than its factorization.
105560055511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11622041.
The product of its (nonzero) digits is 18750, while the sum is 34.
It can be divided in two parts, 1055600 and 55511, that added together give a palindrome (1111111).
The spelling of 105560055511 in words is "one hundred five billion, five hundred sixty million, fifty-five thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •