Base | Representation |
---|---|
bin | 1001010010101110… |
… | …00110011110001000 |
3 | 110212200110211002111 |
4 | 10221113012132020 |
5 | 40204123421333 |
6 | 2143013112104 |
7 | 234425566540 |
oct | 45127063610 |
9 | 13780424074 |
10 | 4988888968 |
11 | 2130109138 |
12 | b72928634 |
13 | 61676b40b |
14 | 35480c320 |
15 | 1e2eae4cd |
hex | 1295c6788 |
4988888968 has 96 divisors (see below), whose sum is σ = 11315707200. Its totient is φ = 2019498624.
The previous prime is 4988888963. The next prime is 4988888977. The reversal of 4988888968 is 8698888894.
It is a junction number, because it is equal to n+sod(n) for n = 4988888894 and 4988888903.
It is not an unprimeable number, because it can be changed into a prime (4988888963) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2457778 + ... + 2459806.
It is an arithmetic number, because the mean of its divisors is an integer number (117871950).
Almost surely, 24988888968 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 4988888968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5657853600).
4988888968 is an abundant number, since it is smaller than the sum of its proper divisors (6326818232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4988888968 is a wasteful number, since it uses less digits than its factorization.
4988888968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2171 (or 2144 counting only the distinct ones).
The product of its digits is 509607936, while the sum is 76.
The square root of 4988888968 is about 70632.0675614129. The cubic root of 4988888968 is about 1708.7083674408.
The spelling of 4988888968 in words is "four billion, nine hundred eighty-eight million, eight hundred eighty-eight thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •