Base | Representation |
---|---|
bin | 11101100100011… |
… | …101011010110011 |
3 | 1021120111100002000 |
4 | 131210131122303 |
5 | 2004000100242 |
6 | 121121025043 |
7 | 15202516533 |
oct | 3544353263 |
9 | 1246440060 |
10 | 496096947 |
11 | 235040a85 |
12 | 11a185183 |
13 | 7ba196b8 |
14 | 49c5b4c3 |
15 | 2d846a4c |
hex | 1d91d6b3 |
496096947 has 32 divisors (see below), whose sum is σ = 746496000. Its totient is φ = 325575360.
The previous prime is 496096943. The next prime is 496096963. The reversal of 496096947 is 749690694.
It is not a de Polignac number, because 496096947 - 22 = 496096943 is a prime.
It is a super-2 number, since 2×4960969472 = 492224361645441618, which contains 22 as substring.
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 496096893 and 496096902.
It is not an unprimeable number, because it can be changed into a prime (496096943) 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 31 ways as a sum of consecutive naturals, for example, 1035454 + ... + 1035932.
It is an arithmetic number, because the mean of its divisors is an integer number (23328000).
Almost surely, 2496096947 is an apocalyptic number.
496096947 is a deficient number, since it is larger than the sum of its proper divisors (250399053).
496096947 is a wasteful number, since it uses less digits than its factorization.
496096947 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1008 (or 1002 counting only the distinct ones).
The product of its (nonzero) digits is 2939328, while the sum is 54.
The square root of 496096947 is about 22273.2338693778. The cubic root of 496096947 is about 791.6298919255.
The spelling of 496096947 in words is "four hundred ninety-six million, ninety-six thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •