Base | Representation |
---|---|
bin | 11101000011100… |
… | …011001011100000 |
3 | 1020222021000211202 |
4 | 131003203023200 |
5 | 1444243013132 |
6 | 120212100332 |
7 | 15036265505 |
oct | 3503431340 |
9 | 1228230752 |
10 | 487469792 |
11 | 2301892a7 |
12 | 1173046a8 |
13 | 79cb8984 |
14 | 48a534ac |
15 | 2cbe0762 |
hex | 1d0e32e0 |
487469792 has 36 divisors (see below), whose sum is σ = 992079648. Its totient is φ = 235536000.
The previous prime is 487469789. The next prime is 487469819. The reversal of 487469792 is 297964784.
It is a super-2 number, since 2×4874697922 = 475253596225046528, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 5 ways as a sum of consecutive naturals, for example, 695042 + ... + 695742.
It is an arithmetic number, because the mean of its divisors is an integer number (27557768).
Almost surely, 2487469792 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 487469792, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (496039824).
487469792 is an abundant number, since it is smaller than the sum of its proper divisors (504609856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
487469792 is an frugal number, since it uses more digits than its factorization.
487469792 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1443 (or 734 counting only the distinct ones).
The product of its digits is 6096384, while the sum is 56.
The square root of 487469792 is about 22078.7180787291. The cubic root of 487469792 is about 787.0142018322.
The spelling of 487469792 in words is "four hundred eighty-seven million, four hundred sixty-nine thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •