Base | Representation |
---|---|
bin | 110111011100011… |
… | …101001001011001 |
3 | 2101211100101011002 |
4 | 313130131021121 |
5 | 3401113100142 |
6 | 232145314345 |
7 | 32023423466 |
oct | 6734351131 |
9 | 2354311132 |
10 | 930206297 |
11 | 438093839 |
12 | 21b6359b5 |
13 | 11a941537 |
14 | 8b78066d |
15 | 569e6a32 |
hex | 3771d259 |
930206297 has 2 divisors, whose sum is σ = 930206298. Its totient is φ = 930206296.
The previous prime is 930206279. The next prime is 930206341. The reversal of 930206297 is 792602039.
Together with previous prime (930206279) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 897361936 + 32844361 = 29956^2 + 5731^2 .
It is a cyclic number.
It is not a de Polignac number, because 930206297 - 210 = 930205273 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 930206297.
It is not a weakly prime, because it can be changed into another prime (930206267) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 465103148 + 465103149.
It is an arithmetic number, because the mean of its divisors is an integer number (465103149).
Almost surely, 2930206297 is an apocalyptic number.
It is an amenable number.
930206297 is a deficient number, since it is larger than the sum of its proper divisors (1).
930206297 is an equidigital number, since it uses as much as digits as its factorization.
930206297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40824, while the sum is 38.
The square root of 930206297 is about 30499.2835489623. The cubic root of 930206297 is about 976.1721767064.
The spelling of 930206297 in words is "nine hundred thirty million, two hundred six thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •