Base | Representation |
---|---|
bin | 1100100101101… |
… | …01010000110111 |
3 | 21100201001001011 |
4 | 12102311100313 |
5 | 204013200210 |
6 | 14251213051 |
7 | 2421404611 |
oct | 622652067 |
9 | 240631034 |
10 | 105600055 |
11 | 54676980 |
12 | 2b447187 |
13 | 18b54752 |
14 | 1004bdb1 |
15 | 940dd8a |
hex | 64b5437 |
105600055 has 8 divisors (see below), whose sum is σ = 138240144. Its totient is φ = 76800000.
The previous prime is 105600041. The next prime is 105600067. The reversal of 105600055 is 550006501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-105600055 is a prime.
It is a super-2 number, since 2×1056000552 = 22302743232006050, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 105599999 and 105600035.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 959946 + ... + 960055.
It is an arithmetic number, because the mean of its divisors is an integer number (17280018).
Almost surely, 2105600055 is an apocalyptic number.
105600055 is a deficient number, since it is larger than the sum of its proper divisors (32640089).
105600055 is a wasteful number, since it uses less digits than its factorization.
105600055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1920017.
The product of its (nonzero) digits is 750, while the sum is 22.
The square root of 105600055 is about 10276.1887390219. The cubic root of 105600055 is about 472.6663822471. Note that the first 3 decimals are identical.
Adding to 105600055 its reverse (550006501), we get a palindrome (655606556).
It can be divided in two parts, 10 and 5600055, that added together give a palindrome (5600065).
The spelling of 105600055 in words is "one hundred five million, six hundred thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •