Base | Representation |
---|---|
bin | 1110001110101111011… |
… | …00011101001101101100 |
3 | 1201202001202210121001012 |
4 | 13013113230131031230 |
5 | 31002332203404014 |
6 | 1012342012404352 |
7 | 50216431635446 |
oct | 7072754351554 |
9 | 1652052717035 |
10 | 488950059884 |
11 | 1793a961a990 |
12 | 7a9184766b8 |
13 | 37152a89380 |
14 | 19945873496 |
15 | caba9cbc3e |
hex | 71d7b1d36c |
488950059884 has 48 divisors (see below), whose sum is σ = 1024221088800. Its totient is φ = 201283031040.
The previous prime is 488950059881. The next prime is 488950059929.
488950059884 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×4889500598842 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (488950059881) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8033909 + ... + 8094540.
It is an arithmetic number, because the mean of its divisors is an integer number (21337939350).
Almost surely, 2488950059884 is an apocalyptic number.
488950059884 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
488950059884 is an abundant number, since it is smaller than the sum of its proper divisors (535271028916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
488950059884 is a wasteful number, since it uses less digits than its factorization.
488950059884 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16128530 (or 16128528 counting only the distinct ones).
The product of its (nonzero) digits is 132710400, while the sum is 68.
The spelling of 488950059884 in words is "four hundred eighty-eight billion, nine hundred fifty million, fifty-nine thousand, eight hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •