Base | Representation |
---|---|
bin | 100100011000110100111… |
… | …1100000111110111010000 |
3 | 122201002202121021111211110 |
4 | 1020301221330013313100 |
5 | 1123414243020113242 |
6 | 14345252115013320 |
7 | 1024214253443436 |
oct | 110615174076720 |
9 | 18632677244743 |
10 | 5001119301072 |
11 | 1658a65514a74 |
12 | 68930089a240 |
13 | 2a37acc421ab |
14 | 1340ac2aad56 |
15 | 8a155b1b39c |
hex | 48c69f07dd0 |
5001119301072 has 40 divisors (see below), whose sum is σ = 12939713591040. Its totient is φ = 1664439070720.
The previous prime is 5001119301071. The next prime is 5001119301091. The reversal of 5001119301072 is 2701039111005.
It is a super-2 number, since 2×50011193010722 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5001119301071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 81240672 + ... + 81302207.
It is an arithmetic number, because the mean of its divisors is an integer number (323492839776).
Almost surely, 25001119301072 is an apocalyptic number.
It is an amenable number.
5001119301072 is an abundant number, since it is smaller than the sum of its proper divisors (7938594289968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5001119301072 is a wasteful number, since it uses less digits than its factorization.
5001119301072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162543531 (or 162543525 counting only the distinct ones).
The product of its (nonzero) digits is 1890, while the sum is 30.
The spelling of 5001119301072 in words is "five trillion, one billion, one hundred nineteen million, three hundred one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •