Base | Representation |
---|---|
bin | 1111000111001110110 |
3 | 221011022120 |
4 | 1320321312 |
5 | 111321342 |
6 | 14340410 |
7 | 4131540 |
oct | 1707166 |
9 | 834276 |
10 | 495222 |
11 | 309082 |
12 | 1ba706 |
13 | 144540 |
14 | cc690 |
15 | 9baec |
hex | 78e76 |
495222 has 32 divisors (see below), whose sum is σ = 1220352. Its totient is φ = 130464.
The previous prime is 495221. The next prime is 495241. The reversal of 495222 is 222594.
It is a junction number, because it is equal to n+sod(n) for n = 495192 and 495201.
It is a congruent number.
It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 495222.
It is not an unprimeable number, because it can be changed into a prime (495221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 93 + ... + 999.
It is an arithmetic number, because the mean of its divisors is an integer number (38136).
2495222 is an apocalyptic number.
495222 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 495222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (610176).
495222 is an abundant number, since it is smaller than the sum of its proper divisors (725130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
495222 is a wasteful number, since it uses less digits than its factorization.
495222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 932.
The product of its digits is 1440, while the sum is 24.
The square root of 495222 is about 703.7201148184. The cubic root of 495222 is about 79.1164229052.
It can be divided in two parts, 495 and 222, that added together give a palindrome (717).
The spelling of 495222 in words is "four hundred ninety-five thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •