Base | Representation |
---|---|
bin | 11101100110100… |
… | …010000010000100 |
3 | 1021121111221011222 |
4 | 131212202002010 |
5 | 2004114441012 |
6 | 121140415512 |
7 | 15210241262 |
oct | 3546420204 |
9 | 1247457158 |
10 | 496640132 |
11 | 23538209a |
12 | 11a3a7598 |
13 | 7bb79a01 |
14 | 49d5d432 |
15 | 2d902972 |
hex | 1d9a2084 |
496640132 has 12 divisors (see below), whose sum is σ = 870249996. Its totient is φ = 247997280.
The previous prime is 496640083. The next prime is 496640149. The reversal of 496640132 is 231046694.
It can be written as a sum of positive squares in 2 ways, for example, as 86415616 + 410224516 = 9296^2 + 20254^2 .
It is a hoax number, since the sum of its digits (35) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 496640092 and 496640101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 77219 + ... + 83402.
It is an arithmetic number, because the mean of its divisors is an integer number (72520833).
Almost surely, 2496640132 is an apocalyptic number.
It is an amenable number.
496640132 is a deficient number, since it is larger than the sum of its proper divisors (373609864).
496640132 is a wasteful number, since it uses less digits than its factorization.
496640132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161398 (or 161396 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 35.
The square root of 496640132 is about 22285.4242050718. The cubic root of 496640132 is about 791.9187095596.
The spelling of 496640132 in words is "four hundred ninety-six million, six hundred forty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •