Base | Representation |
---|---|
bin | 1100100011100… |
… | …01101010100011 |
3 | 21100011222020012 |
4 | 12101301222203 |
5 | 203430320141 |
6 | 14241235135 |
7 | 2416142432 |
oct | 621615243 |
9 | 240158205 |
10 | 105323171 |
11 | 544a7948 |
12 | 2b332aab |
13 | 18a88705 |
14 | ddb9119 |
15 | 93a6ceb |
hex | 6471aa3 |
105323171 has 2 divisors, whose sum is σ = 105323172. Its totient is φ = 105323170.
The previous prime is 105323117. The next prime is 105323173. The reversal of 105323171 is 171323501.
Together with previous prime (105323117) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 105323171 - 26 = 105323107 is a prime.
It is a super-2 number, since 2×1053231712 = 22185940698990482, which contains 22 as substring.
Together with 105323173, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (105323173) 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, 52661585 + 52661586.
It is an arithmetic number, because the mean of its divisors is an integer number (52661586).
Almost surely, 2105323171 is an apocalyptic number.
105323171 is a deficient number, since it is larger than the sum of its proper divisors (1).
105323171 is an equidigital number, since it uses as much as digits as its factorization.
105323171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 630, while the sum is 23.
The square root of 105323171 is about 10262.7077810878. The cubic root of 105323171 is about 472.2529092635.
Adding to 105323171 its reverse (171323501), we get a palindrome (276646672).
The spelling of 105323171 in words is "one hundred five million, three hundred twenty-three thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •