Base | Representation |
---|---|
bin | 11101100011111… |
… | …001100100111001 |
3 | 1021120012212200121 |
4 | 131203321210321 |
5 | 2003430401022 |
6 | 121113533241 |
7 | 15201335524 |
oct | 3543714471 |
9 | 1246185617 |
10 | 495950137 |
11 | 234a50751 |
12 | 11a114221 |
13 | 7b997927 |
14 | 49c1dbbb |
15 | 2d8182c7 |
hex | 1d8f9939 |
495950137 has 4 divisors (see below), whose sum is σ = 496029940. Its totient is φ = 495870336.
The previous prime is 495950111. The next prime is 495950159. The reversal of 495950137 is 731059594.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 69155856 + 426794281 = 8316^2 + 20659^2 .
It is a cyclic number.
It is not a de Polignac number, because 495950137 - 215 = 495917369 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 495950093 and 495950102.
It is not an unprimeable number, because it can be changed into a prime (495950167) 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 in 3 ways as a sum of consecutive naturals, for example, 29712 + ... + 43297.
It is an arithmetic number, because the mean of its divisors is an integer number (124007485).
Almost surely, 2495950137 is an apocalyptic number.
It is an amenable number.
495950137 is a deficient number, since it is larger than the sum of its proper divisors (79803).
495950137 is an equidigital number, since it uses as much as digits as its factorization.
495950137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79802.
The product of its (nonzero) digits is 170100, while the sum is 43.
The square root of 495950137 is about 22269.9379657870. The cubic root of 495950137 is about 791.5517951937.
The spelling of 495950137 in words is "four hundred ninety-five million, nine hundred fifty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •