Base | Representation |
---|---|
bin | 1110001100000001011… |
… | …10110000110101001000 |
3 | 1201121022002102001020220 |
4 | 13012000232300311020 |
5 | 30441340201443403 |
6 | 1011541132550040 |
7 | 50135324346000 |
oct | 7060056606510 |
9 | 1647262361226 |
10 | 487491046728 |
11 | 17881aa94794 |
12 | 7a58b922320 |
13 | 36c7c717b8a |
14 | 19847b9d000 |
15 | ca3287b953 |
hex | 7180bb0d48 |
487491046728 has 256 divisors, whose sum is σ = 1506040320000. Its totient is φ = 131072256000.
The previous prime is 487491046717. The next prime is 487491046781. The reversal of 487491046728 is 827640194784.
It is a super-2 number, since 2×4874910467282 (a number of 24 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (60) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 23607288 + ... + 23627928.
It is an arithmetic number, because the mean of its divisors is an integer number (5882970000).
Almost surely, 2487491046728 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 487491046728, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (753020160000).
487491046728 is an abundant number, since it is smaller than the sum of its proper divisors (1018549273272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
487491046728 is a wasteful number, since it uses less digits than its factorization.
487491046728 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20841 (or 20823 counting only the distinct ones).
The product of its (nonzero) digits is 21676032, while the sum is 60.
The spelling of 487491046728 in words is "four hundred eighty-seven billion, four hundred ninety-one million, forty-six thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •