Base | Representation |
---|---|
bin | 1100110010011… |
… | …00010000111011 |
3 | 21110211201211201 |
4 | 12121030100323 |
5 | 204430022011 |
6 | 14351035031 |
7 | 2441520106 |
oct | 631142073 |
9 | 243751751 |
10 | 107267131 |
11 | 55605424 |
12 | 2bb0ba77 |
13 | 192b949a |
14 | 1036373d |
15 | 963ccc1 |
hex | 664c43b |
107267131 has 2 divisors, whose sum is σ = 107267132. Its totient is φ = 107267130.
The previous prime is 107267119. The next prime is 107267137. The reversal of 107267131 is 131762701.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 107267131 - 211 = 107265083 is a prime.
It is a super-2 number, since 2×1072671312 = 23012474785942322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 107267131.
It is not a weakly prime, because it can be changed into another prime (107267137) 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, 53633565 + 53633566.
It is an arithmetic number, because the mean of its divisors is an integer number (53633566).
Almost surely, 2107267131 is an apocalyptic number.
107267131 is a deficient number, since it is larger than the sum of its proper divisors (1).
107267131 is an equidigital number, since it uses as much as digits as its factorization.
107267131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1764, while the sum is 28.
The square root of 107267131 is about 10356.9846480527. The cubic root of 107267131 is about 475.1406874124.
The spelling of 107267131 in words is "one hundred seven million, two hundred sixty-seven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •