Base | Representation |
---|---|
bin | 100100011001000001001… |
… | …0000000101101010100000 |
3 | 122201010211000210022200110 |
4 | 1020302002100011222200 |
5 | 1123421111430010003 |
6 | 14345400405251320 |
7 | 1024230335434512 |
oct | 110620220055240 |
9 | 18633730708613 |
10 | 5001527188128 |
11 | 1659154787609 |
12 | 6893b5403b40 |
13 | 2a38465b5693 |
14 | 13410a525bb2 |
15 | 8a17b83ba03 |
hex | 48c82405aa0 |
5001527188128 has 24 divisors (see below), whose sum is σ = 13129008869088. Its totient is φ = 1667175729344.
The previous prime is 5001527188111. The next prime is 5001527188129. The reversal of 5001527188128 is 8218817251005.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (24).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (5001527188129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26049620676 + ... + 26049620867.
It is an arithmetic number, because the mean of its divisors is an integer number (547042036212).
Almost surely, 25001527188128 is an apocalyptic number.
It is an amenable number.
5001527188128 is an abundant number, since it is smaller than the sum of its proper divisors (8127481680960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5001527188128 is a wasteful number, since it uses less digits than its factorization.
5001527188128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52099241556 (or 52099241548 counting only the distinct ones).
The product of its (nonzero) digits is 358400, while the sum is 48.
The spelling of 5001527188128 in words is "five trillion, one billion, five hundred twenty-seven million, one hundred eighty-eight thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •