Base | Representation |
---|---|
bin | 10110101111010110100000… |
… | …00110000010101110101000 |
3 | 20120001110221022022212111021 |
4 | 23113223100012002232220 |
5 | 23023242231112130000 |
6 | 254204113152142224 |
7 | 13350530630064625 |
oct | 1327532006025650 |
9 | 216043838285437 |
10 | 50005500505000 |
11 | 14a2a239437997 |
12 | 5737498b37974 |
13 | 21b9663182771 |
14 | c4c3c9d5334c |
15 | 5bab579ce11a |
hex | 2d7ad0182ba8 |
50005500505000 has 80 divisors (see below), whose sum is σ = 117938802627360. Its totient is φ = 19869735000000.
The previous prime is 50005500504983. The next prime is 50005500505001. The reversal of 50005500505000 is 50500550005.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (50005500505001) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 32361226 + ... + 33871225.
It is an arithmetic number, because the mean of its divisors is an integer number (1474235032842).
Almost surely, 250005500505000 is an apocalyptic number.
50005500505000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
50005500505000 is an abundant number, since it is smaller than the sum of its proper divisors (67933302122360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50005500505000 is a wasteful number, since it uses less digits than its factorization.
50005500505000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66232628 (or 66232609 counting only the distinct ones).
The product of its (nonzero) digits is 3125, while the sum is 25.
It can be divided in two parts, 50005 and 500505000, that added together give a palindrome (500555005).
The spelling of 50005500505000 in words is "fifty trillion, five billion, five hundred million, five hundred five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •