Base | Representation |
---|---|
bin | 1100100101011… |
… | …00110101011010 |
3 | 21100122021200110 |
4 | 12102230311122 |
5 | 204011044110 |
6 | 14250345150 |
7 | 2421202140 |
oct | 622546532 |
9 | 240567613 |
10 | 105565530 |
11 | 54652a44 |
12 | 2b42b1b6 |
13 | 18b41b15 |
14 | 1003d590 |
15 | 9403a20 |
hex | 64acd5a |
105565530 has 64 divisors (see below), whose sum is σ = 290396160. Its totient is φ = 24058944.
The previous prime is 105565513. The next prime is 105565549. The reversal of 105565530 is 35565501.
It is a super-2 number, since 2×1055655302 = 22288162248361800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 114411 + ... + 115329.
It is an arithmetic number, because the mean of its divisors is an integer number (4537440).
Almost surely, 2105565530 is an apocalyptic number.
105565530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 105565530, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (145198080).
105565530 is an abundant number, since it is smaller than the sum of its proper divisors (184830630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105565530 is a wasteful number, since it uses less digits than its factorization.
105565530 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1483.
The product of its (nonzero) digits is 11250, while the sum is 30.
The square root of 105565530 is about 10274.5087473806. The cubic root of 105565530 is about 472.6148652739.
The spelling of 105565530 in words is "one hundred five million, five hundred sixty-five thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •