Base | Representation |
---|---|
bin | 1100110100010… |
… | …00010100111101 |
3 | 21111022020022111 |
4 | 12122020110331 |
5 | 210010410044 |
6 | 14400214021 |
7 | 2443563262 |
oct | 632102475 |
9 | 244266274 |
10 | 107513149 |
11 | 55763247 |
12 | 3000a311 |
13 | 19374463 |
14 | 103c9269 |
15 | 968ab34 |
hex | 668853d |
107513149 has 2 divisors, whose sum is σ = 107513150. Its totient is φ = 107513148.
The previous prime is 107513143. The next prime is 107513167. The reversal of 107513149 is 941315701.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 75951225 + 31561924 = 8715^2 + 5618^2 .
It is a cyclic number.
It is not a de Polignac number, because 107513149 - 223 = 99124541 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 107513149.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (107513143) 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, 53756574 + 53756575.
It is an arithmetic number, because the mean of its divisors is an integer number (53756575).
Almost surely, 2107513149 is an apocalyptic number.
It is an amenable number.
107513149 is a deficient number, since it is larger than the sum of its proper divisors (1).
107513149 is an equidigital number, since it uses as much as digits as its factorization.
107513149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3780, while the sum is 31.
The square root of 107513149 is about 10368.8547583617. The cubic root of 107513149 is about 475.5036563514.
The spelling of 107513149 in words is "one hundred seven million, five hundred thirteen thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •