Base | Representation |
---|---|
bin | 11101100110101… |
… | …101101101100001 |
3 | 1021121121100210201 |
4 | 131212231231201 |
5 | 2004123003334 |
6 | 121141425201 |
7 | 15210530611 |
oct | 3546555541 |
9 | 1247540721 |
10 | 496687969 |
11 | 235405028 |
12 | 11a40b201 |
13 | 7bb9570b |
14 | 49d72a41 |
15 | 2d911c14 |
hex | 1d9adb61 |
496687969 has 8 divisors (see below), whose sum is σ = 508540032. Its totient is φ = 484849680.
The previous prime is 496687957. The next prime is 496687973. The reversal of 496687969 is 969786694.
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 496687969 - 211 = 496685921 is a prime.
It is a super-2 number, since 2×4966879692 = 493397877098689922, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 496687969.
It is not an unprimeable number, because it can be changed into a prime (496687909) 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 7 ways as a sum of consecutive naturals, for example, 128079 + ... + 131899.
It is an arithmetic number, because the mean of its divisors is an integer number (63567504).
Almost surely, 2496687969 is an apocalyptic number.
It is an amenable number.
496687969 is a deficient number, since it is larger than the sum of its proper divisors (11852063).
496687969 is a wasteful number, since it uses less digits than its factorization.
496687969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6887.
The product of its digits is 35271936, while the sum is 64.
The square root of 496687969 is about 22286.4974592240. The cubic root of 496687969 is about 791.9441349442.
The spelling of 496687969 in words is "four hundred ninety-six million, six hundred eighty-seven thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •