Base | Representation |
---|---|
bin | 11101100000011… |
… | …010100101110000 |
3 | 1021111111110210201 |
4 | 131200122211300 |
5 | 2003212134114 |
6 | 121042204544 |
7 | 15160512634 |
oct | 3540324560 |
9 | 1244443721 |
10 | 495036784 |
11 | 234487510 |
12 | 119953754 |
13 | 7b737c98 |
14 | 49a62dc4 |
15 | 2d6d7874 |
hex | 1d81a970 |
495036784 has 80 divisors (see below), whose sum is σ = 1070931456. Its totient is φ = 219801600.
The previous prime is 495036767. The next prime is 495036791. The reversal of 495036784 is 487630594.
It is a super-2 number, since 2×4950367842 = 490122835026125312, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1826569 + ... + 1826839.
Almost surely, 2495036784 is an apocalyptic number.
495036784 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 495036784, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (535465728).
495036784 is an abundant number, since it is smaller than the sum of its proper divisors (575894672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
495036784 is a wasteful number, since it uses less digits than its factorization.
495036784 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 494 (or 488 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 46.
The square root of 495036784 is about 22249.4221048548. The cubic root of 495036784 is about 791.0655833633.
The spelling of 495036784 in words is "four hundred ninety-five million, thirty-six thousand, seven hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •