Base | Representation |
---|---|
bin | 1100100001111… |
… | …10011110110000 |
3 | 21022210022122100 |
4 | 12100332132300 |
5 | 203402113040 |
6 | 14232540400 |
7 | 2414310261 |
oct | 620763660 |
9 | 238708570 |
10 | 105113520 |
11 | 54374386 |
12 | 2b251700 |
13 | 18a14165 |
14 | dd62968 |
15 | 9364b30 |
hex | 643e7b0 |
105113520 has 60 divisors (see below), whose sum is σ = 353008656. Its totient is φ = 28030080.
The previous prime is 105113509. The next prime is 105113527. The reversal of 105113520 is 25311501.
It is a tau number, because it is divible by the number of its divisors (60).
It is a super-3 number, since 3×1051135203 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 105113493 and 105113502.
It is not an unprimeable number, because it can be changed into a prime (105113527) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 72276 + ... + 73715.
Almost surely, 2105113520 is an apocalyptic number.
105113520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105113520 is an abundant number, since it is smaller than the sum of its proper divisors (247895136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105113520 is a wasteful number, since it uses less digits than its factorization.
105113520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 146010 (or 146001 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 18.
The square root of 105113520 is about 10252.4884784134. The cubic root of 105113520 is about 471.9393535026.
The spelling of 105113520 in words is "one hundred five million, one hundred thirteen thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •