Base | Representation |
---|---|
bin | 1100100101001… |
… | …10001110011001 |
3 | 21100120220112202 |
4 | 12102212032121 |
5 | 204004212312 |
6 | 14250015545 |
7 | 2421030203 |
oct | 622461631 |
9 | 240526482 |
10 | 105538457 |
11 | 54634672 |
12 | 2b4175b5 |
13 | 18b326bb |
14 | 10033773 |
15 | 93ea9c2 |
hex | 64a6399 |
105538457 has 2 divisors, whose sum is σ = 105538458. Its totient is φ = 105538456.
The previous prime is 105538451. The next prime is 105538507. The reversal of 105538457 is 754835501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 87254281 + 18284176 = 9341^2 + 4276^2 .
It is a cyclic number.
It is not a de Polignac number, because 105538457 - 24 = 105538441 is a prime.
It is a super-2 number, since 2×1055384572 = 22276731811881698, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 105538457.
It is not a weakly prime, because it can be changed into another prime (105538451) 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, 52769228 + 52769229.
It is an arithmetic number, because the mean of its divisors is an integer number (52769229).
Almost surely, 2105538457 is an apocalyptic number.
It is an amenable number.
105538457 is a deficient number, since it is larger than the sum of its proper divisors (1).
105538457 is an equidigital number, since it uses as much as digits as its factorization.
105538457 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84000, while the sum is 38.
The square root of 105538457 is about 10273.1911789862. The cubic root of 105538457 is about 472.5744600514.
The spelling of 105538457 in words is "one hundred five million, five hundred thirty-eight thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •