Base | Representation |
---|---|
bin | 11101100001100… |
… | …010011001111001 |
3 | 1021112001102022021 |
4 | 131201202121321 |
5 | 2003301042222 |
6 | 121052354441 |
7 | 15163146343 |
oct | 3541423171 |
9 | 1245042267 |
10 | 495330937 |
11 | 234668512 |
12 | 119a75a21 |
13 | 7b80bb3a |
14 | 49adc293 |
15 | 2d744ac7 |
hex | 1d862679 |
495330937 has 2 divisors, whose sum is σ = 495330938. Its totient is φ = 495330936.
The previous prime is 495330929. The next prime is 495330947. The reversal of 495330937 is 739033594.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 414977641 + 80353296 = 20371^2 + 8964^2 .
It is a cyclic number.
It is not a de Polignac number, because 495330937 - 23 = 495330929 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 495330893 and 495330902.
It is not a weakly prime, because it can be changed into another prime (495330917) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 247665468 + 247665469.
It is an arithmetic number, because the mean of its divisors is an integer number (247665469).
Almost surely, 2495330937 is an apocalyptic number.
It is an amenable number.
495330937 is a deficient number, since it is larger than the sum of its proper divisors (1).
495330937 is an equidigital number, since it uses as much as digits as its factorization.
495330937 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 306180, while the sum is 43.
The square root of 495330937 is about 22256.0314746363. The cubic root of 495330937 is about 791.2222372040. Note that the first 4 decimals are identical.
The spelling of 495330937 in words is "four hundred ninety-five million, three hundred thirty thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •