Base | Representation |
---|---|
bin | 11101100100000… |
… | …000010110100111 |
3 | 1021120021021202200 |
4 | 131210000112213 |
5 | 2003432243040 |
6 | 121114305543 |
7 | 15201512460 |
oct | 3544002647 |
9 | 1246237680 |
10 | 495977895 |
11 | 234a6a596 |
12 | 11a1282b3 |
13 | 7b9a745a |
14 | 49c29d67 |
15 | 2d821630 |
hex | 1d9005a7 |
495977895 has 48 divisors (see below), whose sum is σ = 999198720. Its totient is φ = 222881472.
The previous prime is 495977893. The next prime is 495977899. The reversal of 495977895 is 598779594.
It is not a de Polignac number, because 495977895 - 21 = 495977893 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (495977893) 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 47 ways as a sum of consecutive naturals, for example, 5242 + ... + 31928.
It is an arithmetic number, because the mean of its divisors is an integer number (20816640).
Almost surely, 2495977895 is an apocalyptic number.
495977895 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
495977895 is an abundant number, since it is smaller than the sum of its proper divisors (503220825).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
495977895 is a wasteful number, since it uses less digits than its factorization.
495977895 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26764 (or 26761 counting only the distinct ones).
The product of its digits is 28576800, while the sum is 63.
The square root of 495977895 is about 22270.5611738905. The cubic root of 495977895 is about 791.5665624611.
The spelling of 495977895 in words is "four hundred ninety-five million, nine hundred seventy-seven thousand, eight hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •