Base | Representation |
---|---|
bin | 1100100001001… |
… | …00001010010001 |
3 | 21022120211202111 |
4 | 12100210022101 |
5 | 203340140323 |
6 | 14230345321 |
7 | 2413351051 |
oct | 620441221 |
9 | 238524674 |
10 | 105005713 |
11 | 5430038a |
12 | 2b1bb241 |
13 | 189a7077 |
14 | dd35561 |
15 | 9342c0d |
hex | 6424291 |
105005713 has 2 divisors, whose sum is σ = 105005714. Its totient is φ = 105005712.
The previous prime is 105005657. The next prime is 105005731. The reversal of 105005713 is 317500501.
Together with next prime (105005731) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 66961489 + 38044224 = 8183^2 + 6168^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105005713 is a prime.
It is a super-2 number, since 2×1050057132 = 22052399525276738, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105005213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52502856 + 52502857.
It is an arithmetic number, because the mean of its divisors is an integer number (52502857).
Almost surely, 2105005713 is an apocalyptic number.
It is an amenable number.
105005713 is a deficient number, since it is larger than the sum of its proper divisors (1).
105005713 is an equidigital number, since it uses as much as digits as its factorization.
105005713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 525, while the sum is 22.
The square root of 105005713 is about 10247.2295280237. The cubic root of 105005713 is about 471.7779541259. Note that the first 3 decimals are identical.
The spelling of 105005713 in words is "one hundred five million, five thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •