Base | Representation |
---|---|
bin | 100100011000100101110… |
… | …0111011011110000011010 |
3 | 122201001110010222211201102 |
4 | 1020301023213123300122 |
5 | 1123412222300423200 |
6 | 14345125422551402 |
7 | 1024165535305406 |
oct | 110611347336032 |
9 | 18631403884642 |
10 | 5000610561050 |
11 | 1658824329075 |
12 | 68919a438562 |
13 | 2a372b719bb0 |
14 | 1340608bc106 |
15 | 8a1261286d5 |
hex | 48c4b9dbc1a |
5000610561050 has 48 divisors (see below), whose sum is σ = 10031947836120. Its totient is φ = 1843551594240.
The previous prime is 5000610560983. The next prime is 5000610561071. The reversal of 5000610561050 is 501650160005.
It can be written as a sum of positive squares in 12 ways, for example, as 25083274129 + 4975527286921 = 158377^2 + 2230589^2 .
It is a super-2 number, since 2×50006105610502 (a number of 26 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5466245 + ... + 6315144.
Almost surely, 25000610561050 is an apocalyptic number.
5000610561050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5000610561050 is an abundant number, since it is smaller than the sum of its proper divisors (5031337275070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5000610561050 is a wasteful number, since it uses less digits than its factorization.
5000610561050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11782067 (or 11782062 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 29.
The spelling of 5000610561050 in words is "five trillion, six hundred ten million, five hundred sixty-one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •