Base | Representation |
---|---|
bin | 11101100011010… |
… | …110010100111000 |
3 | 1021112221112122000 |
4 | 131203112110320 |
5 | 2003411241002 |
6 | 121110501000 |
7 | 15200164551 |
oct | 3543262470 |
9 | 1245845560 |
10 | 495805752 |
11 | 234962222 |
12 | 11a064760 |
13 | 7b946cb0 |
14 | 49bc3328 |
15 | 2d7da61c |
hex | 1d8d6538 |
495805752 has 128 divisors (see below), whose sum is σ = 1490529600. Its totient is φ = 151801344.
The previous prime is 495805727. The next prime is 495805753. The reversal of 495805752 is 257508594.
It is a junction number, because it is equal to n+sod(n) for n = 495805698 and 495805707.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (495805753) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 889858 + ... + 890414.
Almost surely, 2495805752 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 495805752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (745264800).
495805752 is an abundant number, since it is smaller than the sum of its proper divisors (994723848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
495805752 is a wasteful number, since it uses less digits than its factorization.
495805752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 902 (or 892 counting only the distinct ones).
The product of its (nonzero) digits is 504000, while the sum is 45.
The square root of 495805752 is about 22266.6960279248. The cubic root of 495805752 is about 791.4749734261.
The spelling of 495805752 in words is "four hundred ninety-five million, eight hundred five thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •