Base | Representation |
---|---|
bin | 1100100010001… |
… | …01110000001101 |
3 | 21022211211111122 |
4 | 12101011300031 |
5 | 203404041214 |
6 | 14233330325 |
7 | 2414463155 |
oct | 621056015 |
9 | 238754448 |
10 | 105143309 |
11 | 543947a7 |
12 | 2b2669a5 |
13 | 18a2489b |
14 | dd6d765 |
15 | 936d88e |
hex | 6445c0d |
105143309 has 2 divisors, whose sum is σ = 105143310. Its totient is φ = 105143308.
The previous prime is 105143279. The next prime is 105143329. The reversal of 105143309 is 903341501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 57229225 + 47914084 = 7565^2 + 6922^2 .
It is a cyclic number.
It is not a de Polignac number, because 105143309 - 216 = 105077773 is a prime.
It is a super-2 number, since 2×1051433092 = 22110230854938962, which contains 22 as substring.
It is equal to p6040466 and since 105143309 and 6040466 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105143329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52571654 + 52571655.
It is an arithmetic number, because the mean of its divisors is an integer number (52571655).
Almost surely, 2105143309 is an apocalyptic number.
It is an amenable number.
105143309 is a deficient number, since it is larger than the sum of its proper divisors (1).
105143309 is an equidigital number, since it uses as much as digits as its factorization.
105143309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 26.
The square root of 105143309 is about 10253.9411447501. The cubic root of 105143309 is about 471.9839315726.
The spelling of 105143309 in words is "one hundred five million, one hundred forty-three thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •