Base | Representation |
---|---|
bin | 1100100100001… |
… | …11111011000101 |
3 | 21100100121021212 |
4 | 12102013323011 |
5 | 203441224331 |
6 | 14243221205 |
7 | 2420002304 |
oct | 622077305 |
9 | 240317255 |
10 | 105414341 |
11 | 5455a39a |
12 | 2b377805 |
13 | 18abb066 |
14 | 1000043b |
15 | 93c3d2b |
hex | 6487ec5 |
105414341 has 2 divisors, whose sum is σ = 105414342. Its totient is φ = 105414340.
The previous prime is 105414329. The next prime is 105414343. The reversal of 105414341 is 143414501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 63760225 + 41654116 = 7985^2 + 6454^2 .
It is a cyclic number.
It is not a de Polignac number, because 105414341 - 210 = 105413317 is a prime.
It is a super-2 number, since 2×1054143412 = 22224366576928562, which contains 22 as substring.
Together with 105414343, it forms a pair of twin primes.
It is a Chen prime.
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105414343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52707170 + 52707171.
It is an arithmetic number, because the mean of its divisors is an integer number (52707171).
Almost surely, 2105414341 is an apocalyptic number.
It is an amenable number.
105414341 is a deficient number, since it is larger than the sum of its proper divisors (1).
105414341 is an equidigital number, since it uses as much as digits as its factorization.
105414341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 960, while the sum is 23.
The square root of 105414341 is about 10267.1486304621. The cubic root of 105414341 is about 472.3891340534.
Adding to 105414341 its reverse (143414501), we get a palindrome (248828842).
The spelling of 105414341 in words is "one hundred five million, four hundred fourteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •