Base | Representation |
---|---|
bin | 11101010000001… |
… | …001010100100111 |
3 | 1021012110210021112 |
4 | 131100021110213 |
5 | 2001114144001 |
6 | 120410535235 |
7 | 15106330301 |
oct | 3520112447 |
9 | 1235423245 |
10 | 490771751 |
11 | 232034098 |
12 | 11843751b |
13 | 7a8a38b2 |
14 | 49272971 |
15 | 2d143cbb |
hex | 1d409527 |
490771751 has 4 divisors (see below), whose sum is σ = 493710672. Its totient is φ = 487832832.
The previous prime is 490771747. The next prime is 490771753. The reversal of 490771751 is 157177094.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 157177094 = 2 ⋅78588547.
It is a cyclic number.
It is not a de Polignac number, because 490771751 - 22 = 490771747 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 490771699 and 490771708.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (490771753) 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, 1469210 + ... + 1469543.
It is an arithmetic number, because the mean of its divisors is an integer number (123427668).
Almost surely, 2490771751 is an apocalyptic number.
490771751 is a deficient number, since it is larger than the sum of its proper divisors (2938921).
490771751 is a wasteful number, since it uses less digits than its factorization.
490771751 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2938920.
The product of its (nonzero) digits is 61740, while the sum is 41.
The square root of 490771751 is about 22153.3688408784. The cubic root of 490771751 is about 788.7871958368.
The spelling of 490771751 in words is "four hundred ninety million, seven hundred seventy-one thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •