Base | Representation |
---|---|
bin | 1100100110101… |
… | …01000000111110 |
3 | 21100221122110000 |
4 | 12103111000332 |
5 | 204031330420 |
6 | 14254055130 |
7 | 2422456023 |
oct | 623250076 |
9 | 240848400 |
10 | 105730110 |
11 | 54755662 |
12 | 2b4aa4a6 |
13 | 18b9b9c5 |
14 | 1008354a |
15 | 9437690 |
hex | 64d503e |
105730110 has 40 divisors (see below), whose sum is σ = 284298696. Its totient is φ = 28194480.
The previous prime is 105730091. The next prime is 105730111. The reversal of 105730110 is 11037501.
It is a happy number.
It is a super-2 number, since 2×1057301102 = 22357712321224200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105730111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 64456 + ... + 66075.
Almost surely, 2105730110 is an apocalyptic number.
105730110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105730110 is an abundant number, since it is smaller than the sum of its proper divisors (178568586).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105730110 is a wasteful number, since it uses less digits than its factorization.
105730110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130550 (or 130541 counting only the distinct ones).
The product of its (nonzero) digits is 105, while the sum is 18.
The square root of 105730110 is about 10282.5147702301. The cubic root of 105730110 is about 472.8603449221.
Adding to 105730110 its reverse (11037501), we get a palindrome (116767611).
The spelling of 105730110 in words is "one hundred five million, seven hundred thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •