Base | Representation |
---|---|
bin | 11101100011101… |
… | …000000100111101 |
3 | 1021120002020100221 |
4 | 131203220010331 |
5 | 2003421102321 |
6 | 121112221341 |
7 | 15200616541 |
oct | 3543500475 |
9 | 1246066327 |
10 | 495878461 |
11 | 234a01911 |
12 | 11a09a851 |
13 | 7b971110 |
14 | 49c01a21 |
15 | 2d801e41 |
hex | 1d8e813d |
495878461 has 4 divisors (see below), whose sum is σ = 534022972. Its totient is φ = 457733952.
The previous prime is 495878447. The next prime is 495878483. The reversal of 495878461 is 164878594.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 164878594 = 2 ⋅82439297.
It can be written as a sum of positive squares in 2 ways, for example, as 340402500 + 155475961 = 18450^2 + 12469^2 .
It is not a de Polignac number, because 495878461 - 25 = 495878429 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 495878399 and 495878408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (495878401) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19072236 + ... + 19072261.
It is an arithmetic number, because the mean of its divisors is an integer number (133505743).
Almost surely, 2495878461 is an apocalyptic number.
It is an amenable number.
495878461 is a deficient number, since it is larger than the sum of its proper divisors (38144511).
495878461 is a wasteful number, since it uses less digits than its factorization.
495878461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38144510.
The product of its digits is 1935360, while the sum is 52.
The square root of 495878461 is about 22268.3286530444. The cubic root of 495878461 is about 791.5136609838.
The spelling of 495878461 in words is "four hundred ninety-five million, eight hundred seventy-eight thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •