Base | Representation |
---|---|
bin | 1100100011111… |
… | …10110111110101 |
3 | 21100021201102211 |
4 | 12101332313311 |
5 | 203434033034 |
6 | 14242333421 |
7 | 2416456234 |
oct | 621766765 |
9 | 240251384 |
10 | 105377269 |
11 | 54534558 |
12 | 2b35a271 |
13 | 18aa721a |
14 | ddd0b1b |
15 | 93b7d64 |
hex | 647edf5 |
105377269 has 2 divisors, whose sum is σ = 105377270. Its totient is φ = 105377268.
The previous prime is 105377267. The next prime is 105377309. The reversal of 105377269 is 962773501.
It is an a-pointer prime, because the next prime (105377309) can be obtained adding 105377269 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95296644 + 10080625 = 9762^2 + 3175^2 .
It is a cyclic number.
It is not a de Polignac number, because 105377269 - 21 = 105377267 is a prime.
It is a super-2 number, since 2×1053772692 = 22208737643796722, which contains 22 as substring.
Together with 105377267, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105377267) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52688634 + 52688635.
It is an arithmetic number, because the mean of its divisors is an integer number (52688635).
Almost surely, 2105377269 is an apocalyptic number.
It is an amenable number.
105377269 is a deficient number, since it is larger than the sum of its proper divisors (1).
105377269 is an equidigital number, since it uses as much as digits as its factorization.
105377269 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 79380, while the sum is 40.
The square root of 105377269 is about 10265.3431019134. The cubic root of 105377269 is about 472.3337511294. Note that the first 3 decimals are identical.
The spelling of 105377269 in words is "one hundred five million, three hundred seventy-seven thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •