Base | Representation |
---|---|
bin | 1000001101101… |
… | …10000011100001 |
3 | 11210122122100001 |
4 | 10012312003201 |
5 | 120114400022 |
6 | 10500500001 |
7 | 1464444532 |
oct | 406660341 |
9 | 153578301 |
10 | 68903137 |
11 | 35991a46 |
12 | 1b0aa601 |
13 | 113764b4 |
14 | 9218689 |
15 | 60b0b27 |
hex | 41b60e1 |
68903137 has 2 divisors, whose sum is σ = 68903138. Its totient is φ = 68903136.
The previous prime is 68903069. The next prime is 68903161. The reversal of 68903137 is 73130986.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 64899136 + 4004001 = 8056^2 + 2001^2 .
It is a cyclic number.
It is not a de Polignac number, because 68903137 - 223 = 60514529 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 68903096 and 68903105.
It is not a weakly prime, because it can be changed into another prime (68913137) 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, 34451568 + 34451569.
It is an arithmetic number, because the mean of its divisors is an integer number (34451569).
Almost surely, 268903137 is an apocalyptic number.
It is an amenable number.
68903137 is a deficient number, since it is larger than the sum of its proper divisors (1).
68903137 is an equidigital number, since it uses as much as digits as its factorization.
68903137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 37.
The square root of 68903137 is about 8300.7913478174. The cubic root of 68903137 is about 409.9645755632.
The spelling of 68903137 in words is "sixty-eight million, nine hundred three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •