Base | Representation |
---|---|
bin | 11100111111110… |
… | …101001101100000 |
3 | 1020220102111210000 |
4 | 130333311031200 |
5 | 1444020320242 |
6 | 120135140000 |
7 | 15025065660 |
oct | 3477651540 |
9 | 1226374700 |
10 | 486495072 |
11 | 22a682a48 |
12 | 116b14600 |
13 | 79a3710b |
14 | 4887c1a0 |
15 | 2ca9ba4c |
hex | 1cff5360 |
486495072 has 120 divisors (see below), whose sum is σ = 1635224976. Its totient is φ = 138993408.
The previous prime is 486495071. The next prime is 486495127. The reversal of 486495072 is 270594684.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (486495071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 4738 + ... + 31550.
Almost surely, 2486495072 is an apocalyptic number.
486495072 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 486495072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (817612488).
486495072 is an abundant number, since it is smaller than the sum of its proper divisors (1148729904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
486495072 is a wasteful number, since it uses less digits than its factorization.
486495072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26842 (or 26825 counting only the distinct ones).
The product of its (nonzero) digits is 483840, while the sum is 45.
The square root of 486495072 is about 22056.6332879703. The cubic root of 486495072 is about 786.4892938541.
The spelling of 486495072 in words is "four hundred eighty-six million, four hundred ninety-five thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •