Base | Representation |
---|---|
bin | 1110011011001100100… |
… | …11000000000001000000 |
3 | 1202101022211101112121120 |
4 | 13031212103000001000 |
5 | 31110031144331442 |
6 | 1015405343352240 |
7 | 50544234126411 |
oct | 7154623000100 |
9 | 1671284345546 |
10 | 495637495872 |
11 | 181220499592 |
12 | 80083bb2680 |
13 | 3797a3b589c |
14 | 19dbbaa9808 |
15 | cd5cb544ec |
hex | 73664c0040 |
495637495872 has 56 divisors (see below), whose sum is σ = 1388513876256. Its totient is φ = 155494115328.
The previous prime is 495637495831. The next prime is 495637495877. The reversal of 495637495872 is 278594736594.
It is a junction number, because it is equal to n+sod(n) for n = 495637495797 and 495637495806.
It is not an unprimeable number, because it can be changed into a prime (495637495877) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 75921598 + ... + 75928125.
Almost surely, 2495637495872 is an apocalyptic number.
It is an amenable number.
495637495872 is an abundant number, since it is smaller than the sum of its proper divisors (892876380384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
495637495872 is a wasteful number, since it uses less digits than its factorization.
495637495872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151849755 (or 151849745 counting only the distinct ones).
The product of its digits is 457228800, while the sum is 69.
The spelling of 495637495872 in words is "four hundred ninety-five billion, six hundred thirty-seven million, four hundred ninety-five thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •