Base | Representation |
---|---|
bin | 1100100101000… |
… | …00000000111001 |
3 | 21100112121122112 |
4 | 12102200000321 |
5 | 204002404032 |
6 | 14245302105 |
7 | 2420563061 |
oct | 622400071 |
9 | 240477575 |
10 | 105513017 |
11 | 54617545 |
12 | 2b404935 |
13 | 18b23c4c |
14 | 100283a1 |
15 | 93e31b2 |
hex | 64a0039 |
105513017 has 2 divisors, whose sum is σ = 105513018. Its totient is φ = 105513016.
The previous prime is 105512993. The next prime is 105513019. The reversal of 105513017 is 710315501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100721296 + 4791721 = 10036^2 + 2189^2 .
It is a cyclic number.
It is not a de Polignac number, because 105513017 - 210 = 105511993 is a prime.
It is a super-2 number, since 2×1055130172 = 22265993512884578, which contains 22 as substring.
Together with 105513019, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 105512983 and 105513001.
It is not a weakly prime, because it can be changed into another prime (105513019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52756508 + 52756509.
It is an arithmetic number, because the mean of its divisors is an integer number (52756509).
Almost surely, 2105513017 is an apocalyptic number.
It is an amenable number.
105513017 is a deficient number, since it is larger than the sum of its proper divisors (1).
105513017 is an equidigital number, since it uses as much as digits as its factorization.
105513017 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 23.
The square root of 105513017 is about 10271.9529301881. The cubic root of 105513017 is about 472.5364857094.
Adding to 105513017 its reverse (710315501), we get a palindrome (815828518).
The spelling of 105513017 in words is "one hundred five million, five hundred thirteen thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •