Base | Representation |
---|---|
bin | 11101000001111… |
… | …111010100110100 |
3 | 1020221111020210110 |
4 | 131001333110310 |
5 | 1444141421123 |
6 | 120155223020 |
7 | 15032643204 |
oct | 3501772464 |
9 | 1227436713 |
10 | 487060788 |
11 | 22aa29a85 |
12 | 117147a70 |
13 | 79ba4766 |
14 | 48988404 |
15 | 2cb5e493 |
hex | 1d07f534 |
487060788 has 48 divisors (see below), whose sum is σ = 1203632640. Its totient is φ = 152971104.
The previous prime is 487060757. The next prime is 487060793. The reversal of 487060788 is 887060784.
It is a super-2 number, since 2×4870607882 = 474456422414361888, which contains 22 as substring.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5323 + ... + 31661.
It is an arithmetic number, because the mean of its divisors is an integer number (25075680).
Almost surely, 2487060788 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 487060788, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (601816320).
487060788 is an abundant number, since it is smaller than the sum of its proper divisors (716571852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
487060788 is a wasteful number, since it uses less digits than its factorization.
487060788 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26436 (or 26434 counting only the distinct ones).
The product of its (nonzero) digits is 602112, while the sum is 48.
The square root of 487060788 is about 22069.4537313455. The cubic root of 487060788 is about 786.7940295398.
The spelling of 487060788 in words is "four hundred eighty-seven million, sixty thousand, seven hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •