Base | Representation |
---|---|
bin | 1100100011001… |
… | …00010111011001 |
3 | 21100002012111122 |
4 | 12101210113121 |
5 | 203422044242 |
6 | 14240135025 |
7 | 2415524552 |
oct | 621442731 |
9 | 240065448 |
10 | 105268697 |
11 | 5446aa26 |
12 | 2b307475 |
13 | 18a69991 |
14 | dda3329 |
15 | 9395ad2 |
hex | 64645d9 |
105268697 has 2 divisors, whose sum is σ = 105268698. Its totient is φ = 105268696.
The previous prime is 105268679. The next prime is 105268703. The reversal of 105268697 is 796862501.
Together with previous prime (105268679) 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., 58537801 + 46730896 = 7651^2 + 6836^2 .
It is a cyclic number.
It is not a de Polignac number, because 105268697 - 214 = 105252313 is a prime.
It is a super-2 number, since 2×1052686972 = 22162997136155618, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (105268627) 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, 52634348 + 52634349.
It is an arithmetic number, because the mean of its divisors is an integer number (52634349).
Almost surely, 2105268697 is an apocalyptic number.
It is an amenable number.
105268697 is a deficient number, since it is larger than the sum of its proper divisors (1).
105268697 is an equidigital number, since it uses as much as digits as its factorization.
105268697 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 181440, while the sum is 44.
The square root of 105268697 is about 10260.0534598997. The cubic root of 105268697 is about 472.1714775420.
The spelling of 105268697 in words is "one hundred five million, two hundred sixty-eight thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •