Base | Representation |
---|---|
bin | 11101100101111… |
… | …100100001000101 |
3 | 1021121020010101202 |
4 | 131211330201011 |
5 | 2004100031334 |
6 | 121133232245 |
7 | 15206031263 |
oct | 3545744105 |
9 | 1247203352 |
10 | 496486469 |
11 | 2352876a6 |
12 | 11a332685 |
13 | 7bb24a9b |
14 | 49d1d433 |
15 | 2d8c217e |
hex | 1d97c845 |
496486469 has 4 divisors (see below), whose sum is σ = 496531596. Its totient is φ = 496441344.
The previous prime is 496486451. The next prime is 496486519. The reversal of 496486469 is 964684694.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 99002500 + 397483969 = 9950^2 + 19937^2 .
It is a cyclic number.
It is not a de Polignac number, because 496486469 - 224 = 479709253 is a prime.
It is a super-2 number, since 2×4964864692 = 492997627800175922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (496486369) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5957 + ... + 32069.
It is an arithmetic number, because the mean of its divisors is an integer number (124132899).
Almost surely, 2496486469 is an apocalyptic number.
It is an amenable number.
496486469 is a deficient number, since it is larger than the sum of its proper divisors (45127).
496486469 is a wasteful number, since it uses less digits than its factorization.
496486469 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45126.
The product of its digits is 8957952, while the sum is 56.
The square root of 496486469 is about 22281.9763261700. The cubic root of 496486469 is about 791.8370265667.
The spelling of 496486469 in words is "four hundred ninety-six million, four hundred eighty-six thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.323 sec. • engine limits •