Base | Representation |
---|---|
bin | 1100100011100… |
… | …00001100001000 |
3 | 21100011122221101 |
4 | 12101300030020 |
5 | 203430122003 |
6 | 14241151144 |
7 | 2416116010 |
oct | 621601410 |
9 | 240148841 |
10 | 105317128 |
11 | 544a3354 |
12 | 2b32b4b4 |
13 | 18a85a37 |
14 | ddb6c40 |
15 | 93a511d |
hex | 6470308 |
105317128 has 16 divisors (see below), whose sum is σ = 225679680. Its totient is φ = 45135888.
The previous prime is 105317117. The next prime is 105317129. The reversal of 105317128 is 821713501.
It is a super-2 number, since 2×1053171282 = 22183394900336768, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 105317096 and 105317105.
It is not an unprimeable number, because it can be changed into a prime (105317129) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 940276 + ... + 940387.
It is an arithmetic number, because the mean of its divisors is an integer number (14104980).
Almost surely, 2105317128 is an apocalyptic number.
It is an amenable number.
105317128 is an abundant number, since it is smaller than the sum of its proper divisors (120362552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105317128 is a wasteful number, since it uses less digits than its factorization.
105317128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1880676 (or 1880672 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 28.
The square root of 105317128 is about 10262.4133613882. The cubic root of 105317128 is about 472.2438771297.
It can be divided in two parts, 1053 and 17128, that added together give a palindrome (18181).
The spelling of 105317128 in words is "one hundred five million, three hundred seventeen thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •