Base | Representation |
---|---|
bin | 11101100000011… |
… | …000011010110001 |
3 | 1021111111000121021 |
4 | 131200120122301 |
5 | 2003211343024 |
6 | 121042055441 |
7 | 15160444666 |
oct | 3540303261 |
9 | 1244430537 |
10 | 495027889 |
11 | 234480864 |
12 | 11994a581 |
13 | 7b733c15 |
14 | 49a5da6d |
15 | 2d6d4de4 |
hex | 1d8186b1 |
495027889 has 4 divisors (see below), whose sum is σ = 495933424. Its totient is φ = 494122356.
The previous prime is 495027851. The next prime is 495027899. The reversal of 495027889 is 988720594.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 495027889 - 27 = 495027761 is a prime.
It is a super-2 number, since 2×4950278892 = 490105221775592642, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (495027899) 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 in 3 ways as a sum of consecutive naturals, for example, 451947 + ... + 453040.
It is an arithmetic number, because the mean of its divisors is an integer number (123983356).
Almost surely, 2495027889 is an apocalyptic number.
It is an amenable number.
495027889 is a deficient number, since it is larger than the sum of its proper divisors (905535).
495027889 is an equidigital number, since it uses as much as digits as its factorization.
495027889 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 905534.
The product of its (nonzero) digits is 1451520, while the sum is 52.
The square root of 495027889 is about 22249.2222111246. Note that the first 4 decimals coincide. The cubic root of 495027889 is about 791.0608452841.
The spelling of 495027889 in words is "four hundred ninety-five million, twenty-seven thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •