Base | Representation |
---|---|
bin | 1100101010000… |
… | …01001001100101 |
3 | 21101210011000102 |
4 | 12111001021211 |
5 | 204140014104 |
6 | 14311353445 |
7 | 2426312234 |
oct | 625011145 |
9 | 241704012 |
10 | 106173029 |
11 | 54a28406 |
12 | 2b682885 |
13 | 18cc54a1 |
14 | 1015ab1b |
15 | 94c3a1e |
hex | 6541265 |
106173029 has 2 divisors, whose sum is σ = 106173030. Its totient is φ = 106173028.
The previous prime is 106172993. The next prime is 106173059. The reversal of 106173029 is 920371601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88322404 + 17850625 = 9398^2 + 4225^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106173029 is a prime.
It is a super-2 number, since 2×1061730292 = 22545424174069682, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 106172992 and 106173010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106173059) 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, 53086514 + 53086515.
It is an arithmetic number, because the mean of its divisors is an integer number (53086515).
Almost surely, 2106173029 is an apocalyptic number.
It is an amenable number.
106173029 is a deficient number, since it is larger than the sum of its proper divisors (1).
106173029 is an equidigital number, since it uses as much as digits as its factorization.
106173029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 29.
The square root of 106173029 is about 10304.0297456869. The cubic root of 106173029 is about 473.5197189110.
The spelling of 106173029 in words is "one hundred six million, one hundred seventy-three thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •