Base | Representation |
---|---|
bin | 1100110000110… |
… | …01101011001001 |
3 | 21110110012120222 |
4 | 12120121223021 |
5 | 204401404123 |
6 | 14342355425 |
7 | 2436665012 |
oct | 630315311 |
9 | 243405528 |
10 | 107059913 |
11 | 55483774 |
12 | 2ba2bb75 |
13 | 1924607c |
14 | 1030c009 |
15 | 95eb6c8 |
hex | 6619ac9 |
107059913 has 2 divisors, whose sum is σ = 107059914. Its totient is φ = 107059912.
The previous prime is 107059861. The next prime is 107059919. The reversal of 107059913 is 319950701.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101042704 + 6017209 = 10052^2 + 2453^2 .
It is a cyclic number.
It is not a de Polignac number, because 107059913 - 28 = 107059657 is a prime.
It is a super-2 number, since 2×1070599132 = 22923649943135138, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (107059919) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a good prime.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53529956 + 53529957.
It is an arithmetic number, because the mean of its divisors is an integer number (53529957).
Almost surely, 2107059913 is an apocalyptic number.
It is an amenable number.
107059913 is a deficient number, since it is larger than the sum of its proper divisors (1).
107059913 is an equidigital number, since it uses as much as digits as its factorization.
107059913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8505, while the sum is 35.
The square root of 107059913 is about 10346.9760316722. The cubic root of 107059913 is about 474.8345322085.
The spelling of 107059913 in words is "one hundred seven million, fifty-nine thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •