Base | Representation |
---|---|
bin | 1100100001000… |
… | …10110010101001 |
3 | 21022120120001210 |
4 | 12100202302221 |
5 | 203340000410 |
6 | 14230303333 |
7 | 2413325520 |
oct | 620426251 |
9 | 238516053 |
10 | 105000105 |
11 | 542a7151 |
12 | 2b1b7b49 |
13 | 189a4652 |
14 | dd334b7 |
15 | 9341220 |
hex | 6422ca9 |
105000105 has 32 divisors (see below), whose sum is σ = 193920768. Its totient is φ = 47520000.
The previous prime is 105000073. The next prime is 105000107. The reversal of 105000105 is 501000501.
It is not a de Polignac number, because 105000105 - 25 = 105000073 is a prime.
It is a super-4 number, since 4×1050001054 (a number of 33 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (105000107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5655 + ... + 15555.
It is an arithmetic number, because the mean of its divisors is an integer number (6060024).
Almost surely, 2105000105 is an apocalyptic number.
105000105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
105000105 is a deficient number, since it is larger than the sum of its proper divisors (88920663).
105000105 is a wasteful number, since it uses less digits than its factorization.
105000105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10017.
The product of its (nonzero) digits is 25, while the sum is 12.
The square root of 105000105 is about 10246.9558894337. The cubic root of 105000105 is about 471.7695552881.
Adding to 105000105 its reverse (501000501), we get a palindrome (606000606).
The spelling of 105000105 in words is "one hundred five million, one hundred five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.224 sec. • engine limits •