Base | Representation |
---|---|
bin | 1100111110111… |
… | …11000110010101 |
3 | 21120221120020012 |
4 | 12133133012111 |
5 | 210340322031 |
6 | 14450250005 |
7 | 2461531454 |
oct | 637370625 |
9 | 246846205 |
10 | 108917141 |
11 | 56532073 |
12 | 30586905 |
13 | 19746518 |
14 | 10672b9b |
15 | 9866b2b |
hex | 67df195 |
108917141 has 2 divisors, whose sum is σ = 108917142. Its totient is φ = 108917140.
The previous prime is 108917117. The next prime is 108917191. The reversal of 108917141 is 141719801.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 85636516 + 23280625 = 9254^2 + 4825^2 .
It is a cyclic number.
It is not a de Polignac number, because 108917141 - 26 = 108917077 is a prime.
It is a super-2 number, since 2×1089171412 = 23725887207227762, 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 = 108917098 and 108917107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (108917111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54458570 + 54458571.
It is an arithmetic number, because the mean of its divisors is an integer number (54458571).
Almost surely, 2108917141 is an apocalyptic number.
It is an amenable number.
108917141 is a deficient number, since it is larger than the sum of its proper divisors (1).
108917141 is an equidigital number, since it uses as much as digits as its factorization.
108917141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 32.
The square root of 108917141 is about 10436.3375280795. The cubic root of 108917141 is about 477.5645459743.
The spelling of 108917141 in words is "one hundred eight million, nine hundred seventeen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •