Base | Representation |
---|---|
bin | 1100100010111… |
… | …01111110001111 |
3 | 21100000212120210 |
4 | 12101131332033 |
5 | 203420230021 |
6 | 14235413503 |
7 | 2415355323 |
oct | 621357617 |
9 | 240025523 |
10 | 105242511 |
11 | 54452290 |
12 | 2b2b4293 |
13 | 18a5aa9a |
14 | dd97983 |
15 | 938ce76 |
hex | 645df8f |
105242511 has 8 divisors (see below), whose sum is σ = 153080064. Its totient is φ = 63783320.
The previous prime is 105242497. The next prime is 105242569. The reversal of 105242511 is 115242501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105242511 - 27 = 105242383 is a prime.
It is a super-2 number, since 2×1052425112 = 22151972243170242, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105242611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1594551 + ... + 1594616.
It is an arithmetic number, because the mean of its divisors is an integer number (19135008).
Almost surely, 2105242511 is an apocalyptic number.
105242511 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
105242511 is a deficient number, since it is larger than the sum of its proper divisors (47837553).
105242511 is a wasteful number, since it uses less digits than its factorization.
105242511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3189181.
The product of its (nonzero) digits is 400, while the sum is 21.
The square root of 105242511 is about 10258.7772663218. Note that the first 3 decimals coincide. The cubic root of 105242511 is about 472.1323227947.
The spelling of 105242511 in words is "one hundred five million, two hundred forty-two thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •