Base | Representation |
---|---|
bin | 1001011001000010… |
… | …00110000000000000 |
3 | 111000101010000102120 |
4 | 10230201012000000 |
5 | 40311202341003 |
6 | 2152144044240 |
7 | 235640635233 |
oct | 45441060000 |
9 | 14011100376 |
10 | 5041840128 |
11 | 2157a95126 |
12 | b88603680 |
13 | 62471ab70 |
14 | 35b87341a |
15 | 1e796d853 |
hex | 12c846000 |
5041840128 has 224 divisors, whose sum is σ = 14855318016. Its totient is φ = 1511129088.
The previous prime is 5041840123. The next prime is 5041840213. The reversal of 5041840128 is 8210481405.
It is a super-2 number, since 2×50418401282 = 50840303752622112768, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5041840123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13737801 + ... + 13738167.
It is an arithmetic number, because the mean of its divisors is an integer number (66318384).
Almost surely, 25041840128 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 5041840128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7427659008).
5041840128 is an abundant number, since it is smaller than the sum of its proper divisors (9813477888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5041840128 is a wasteful number, since it uses less digits than its factorization.
5041840128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 452 (or 428 counting only the distinct ones).
The product of its (nonzero) digits is 10240, while the sum is 33.
The square root of 5041840128 is about 71005.9161478816. The cubic root of 5041840128 is about 1714.7324113386.
The spelling of 5041840128 in words is "five billion, forty-one million, eight hundred forty thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •