Base | Representation |
---|---|
bin | 11101100011011… |
… | …110001111001110 |
3 | 1021120000012002020 |
4 | 131203132033032 |
5 | 2003413310113 |
6 | 121111311010 |
7 | 15200361204 |
oct | 3543361716 |
9 | 1246005066 |
10 | 495838158 |
11 | 234984602 |
12 | 11a07b466 |
13 | 7b95897a |
14 | 49bd1074 |
15 | 2d7e5023 |
hex | 1d8de3ce |
495838158 has 8 divisors (see below), whose sum is σ = 991676328. Its totient is φ = 165279384.
The previous prime is 495838153. The next prime is 495838171. The reversal of 495838158 is 851838594.
It is a sphenic number, since it is the product of 3 distinct primes.
495838158 is an admirable number.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a self number, because there is not a number n which added to its sum of digits gives 495838158.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (495838153) 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, 41319841 + ... + 41319852.
It is an arithmetic number, because the mean of its divisors is an integer number (123959541).
Almost surely, 2495838158 is an apocalyptic number.
495838158 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
495838158 is a wasteful number, since it uses less digits than its factorization.
495838158 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82639698.
The product of its digits is 1382400, while the sum is 51.
The square root of 495838158 is about 22267.4236947160. The cubic root of 495838158 is about 791.4922167242.
The spelling of 495838158 in words is "four hundred ninety-five million, eight hundred thirty-eight thousand, one hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •