Base | Representation |
---|---|
bin | 110001100000100… |
… | …001101001110101 |
3 | 2010212221100202201 |
4 | 301200201221311 |
5 | 3200114010122 |
6 | 214230504501 |
7 | 26404032415 |
oct | 6140415165 |
9 | 2125840681 |
10 | 830610037 |
11 | 396948684 |
12 | 1b2205131 |
13 | 10310c73a |
14 | 7c456645 |
15 | 4cdc1a27 |
hex | 31821a75 |
830610037 has 2 divisors, whose sum is σ = 830610038. Its totient is φ = 830610036.
The previous prime is 830609963. The next prime is 830610073. The reversal of 830610037 is 730016038.
Together with next prime (830610073) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 421316676 + 409293361 = 20526^2 + 20231^2 .
It is a cyclic number.
It is not a de Polignac number, because 830610037 - 223 = 822221429 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 830609987 and 830610014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (830110037) 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, 415305018 + 415305019.
It is an arithmetic number, because the mean of its divisors is an integer number (415305019).
Almost surely, 2830610037 is an apocalyptic number.
It is an amenable number.
830610037 is a deficient number, since it is larger than the sum of its proper divisors (1).
830610037 is an equidigital number, since it uses as much as digits as its factorization.
830610037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 28.
The square root of 830610037 is about 28820.3059838025. The cubic root of 830610037 is about 940.0098222152.
The spelling of 830610037 in words is "eight hundred thirty million, six hundred ten thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •