Base | Representation |
---|---|
bin | 1100110001000… |
… | …10100001010101 |
3 | 21110112001022001 |
4 | 12120202201111 |
5 | 204404034044 |
6 | 14343235301 |
7 | 2440205446 |
oct | 630424125 |
9 | 243461261 |
10 | 107096149 |
11 | 554a8a16 |
12 | 2ba48b31 |
13 | 19259704 |
14 | 1031b2cd |
15 | 96072d4 |
hex | 6622855 |
107096149 has 2 divisors, whose sum is σ = 107096150. Its totient is φ = 107096148.
The previous prime is 107096131. The next prime is 107096161. The reversal of 107096149 is 941690701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99860049 + 7236100 = 9993^2 + 2690^2 .
It is a cyclic number.
It is not a de Polignac number, because 107096149 - 25 = 107096117 is a prime.
It is a super-2 number, since 2×1070961492 = 22939170261260402, which contains 22 as substring.
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (107096849) 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, 53548074 + 53548075.
It is an arithmetic number, because the mean of its divisors is an integer number (53548075).
Almost surely, 2107096149 is an apocalyptic number.
It is an amenable number.
107096149 is a deficient number, since it is larger than the sum of its proper divisors (1).
107096149 is an equidigital number, since it uses as much as digits as its factorization.
107096149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 37.
The square root of 107096149 is about 10348.7269265355. The cubic root of 107096149 is about 474.8880977394. Note that the first 3 decimals are identical.
The spelling of 107096149 in words is "one hundred seven million, ninety-six thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •