Base | Representation |
---|---|
bin | 1100100101001… |
… | …10100110111110 |
3 | 21100120222201000 |
4 | 12102212212332 |
5 | 204004240110 |
6 | 14250031130 |
7 | 2421034611 |
oct | 622464676 |
9 | 240528630 |
10 | 105540030 |
11 | 54635872 |
12 | 2b4184a6 |
13 | 18b3332b |
14 | 10034178 |
15 | 93eb1c0 |
hex | 64a69be |
105540030 has 32 divisors (see below), whose sum is σ = 281440800. Its totient is φ = 28143936.
The previous prime is 105539999. The next prime is 105540053. The reversal of 105540030 is 30045501.
It is a super-2 number, since 2×1055400302 = 22277395864801800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 105539985 and 105540012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 195175 + ... + 195714.
It is an arithmetic number, because the mean of its divisors is an integer number (8795025).
Almost surely, 2105540030 is an apocalyptic number.
105540030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105540030 is an abundant number, since it is smaller than the sum of its proper divisors (175900770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105540030 is a wasteful number, since it uses less digits than its factorization.
105540030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 390905 (or 390899 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 18.
The square root of 105540030 is about 10273.2677371905. The cubic root of 105540030 is about 472.5768078715.
Adding to 105540030 its reverse (30045501), we get a palindrome (135585531).
The spelling of 105540030 in words is "one hundred five million, five hundred forty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •