Base | Representation |
---|---|
bin | 1100100001000… |
… | …10111001011101 |
3 | 21022120120122221 |
4 | 12100202321131 |
5 | 203340004131 |
6 | 14230305341 |
7 | 2413330012 |
oct | 620427135 |
9 | 238516587 |
10 | 105000541 |
11 | 542a7508 |
12 | 2b1b8251 |
13 | 189a48c9 |
14 | dd33709 |
15 | 9341411 |
hex | 6422e5d |
105000541 has 2 divisors, whose sum is σ = 105000542. Its totient is φ = 105000540.
The previous prime is 105000527. The next prime is 105000547. The reversal of 105000541 is 145000501.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102941316 + 2059225 = 10146^2 + 1435^2 .
It is an emirp because it is prime and its reverse (145000501) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105000541 is a prime.
It is a super-2 number, since 2×1050005412 = 22050227220585362, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105000547) 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 as a sum of consecutive naturals, namely, 52500270 + 52500271.
It is an arithmetic number, because the mean of its divisors is an integer number (52500271).
Almost surely, 2105000541 is an apocalyptic number.
It is an amenable number.
105000541 is a deficient number, since it is larger than the sum of its proper divisors (1).
105000541 is an equidigital number, since it uses as much as digits as its factorization.
105000541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 100, while the sum is 16.
The square root of 105000541 is about 10246.9771640226. The cubic root of 105000541 is about 471.7702082755.
The spelling of 105000541 in words is "one hundred five million, five hundred forty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •