Base | Representation |
---|---|
bin | 1001000111101100… |
… | …11010010000000000 |
3 | 110122020111120120000 |
4 | 10203312122100000 |
5 | 40011441330102 |
6 | 2125511320000 |
7 | 232223665212 |
oct | 44366322000 |
9 | 13566446500 |
10 | 4896433152 |
11 | 20929aa776 |
12 | b47980000 |
13 | 600569730 |
14 | 3464225b2 |
15 | 1d9cea01c |
hex | 123d9a400 |
4896433152 has 440 divisors, whose sum is σ = 16644566400. Its totient is φ = 1421328384.
The previous prime is 4896433127. The next prime is 4896433207. The reversal of 4896433152 is 2513346984.
It is a super-2 number, since 2×48964331522 = 47950115224009310208, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4896433098 and 4896433107.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 20487049 + ... + 20487287.
It is an arithmetic number, because the mean of its divisors is an integer number (37828560).
Almost surely, 24896433152 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 4896433152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8322283200).
4896433152 is an abundant number, since it is smaller than the sum of its proper divisors (11748133248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4896433152 is a wasteful number, since it uses less digits than its factorization.
4896433152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 303 (or 276 counting only the distinct ones).
The product of its digits is 622080, while the sum is 45.
The square root of 4896433152 is about 69974.5178761526. The cubic root of 4896433152 is about 1698.0870237210.
The spelling of 4896433152 in words is "four billion, eight hundred ninety-six million, four hundred thirty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •