Base | Representation |
---|---|
bin | 11101100111000… |
… | …110101101110111 |
3 | 1021121210120022010 |
4 | 131213012231313 |
5 | 2004134243031 |
6 | 121143535303 |
7 | 15211435326 |
oct | 3547065567 |
9 | 1247716263 |
10 | 496790391 |
11 | 235474a79 |
12 | 11a45a533 |
13 | 7bc00216 |
14 | 49d9c0bd |
15 | 2d932246 |
hex | 1d9c6b77 |
496790391 has 8 divisors (see below), whose sum is σ = 662492160. Its totient is φ = 331141112.
The previous prime is 496790381. The next prime is 496790401. The reversal of 496790391 is 193097694.
It is an interprime number because it is at equal distance from previous prime (496790381) and next prime (496790401).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 496790391 - 211 = 496788343 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 496790391.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (496790311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23836 + ... + 39518.
It is an arithmetic number, because the mean of its divisors is an integer number (82811520).
Almost surely, 2496790391 is an apocalyptic number.
496790391 is a deficient number, since it is larger than the sum of its proper divisors (165701769).
496790391 is a wasteful number, since it uses less digits than its factorization.
496790391 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26245.
The product of its (nonzero) digits is 367416, while the sum is 48.
The square root of 496790391 is about 22288.7951895117. The cubic root of 496790391 is about 791.9985667891.
The spelling of 496790391 in words is "four hundred ninety-six million, seven hundred ninety thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •