| Base | Representation |
|---|---|
| bin | 100100011000110101011… |
| … | …0010010111010010000000 |
| 3 | 122201002210121000220112102 |
| 4 | 1020301222302113102000 |
| 5 | 1123414310140120000 |
| 6 | 14345253343445532 |
| 7 | 1024214515344152 |
| oct | 110615262272200 |
| 9 | 18632717026472 |
| 10 | 5001133520000 |
| 11 | 1658a72546952 |
| 12 | 6893055b68a8 |
| 13 | 2a37b2b80167 |
| 14 | 1340b012cad2 |
| 15 | 8a156ec93d5 |
| hex | 48c6ac97480 |
5001133520000 has 160 divisors (see below), whose sum is σ = 12879325968300. Its totient is φ = 1931471360000.
The previous prime is 5001133519997. The next prime is 5001133520011. The reversal of 5001133520000 is 253311005.
It can be written as a sum of positive squares in 10 ways, for example, as 947289530944 + 4053843989056 = 973288^2 + 2013416^2 .
It is a tau number, because it is divible by the number of its divisors (160).
It is a super-3 number, since 3×50011335200003 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1242170 + ... + 3397830.
Almost surely, 25001133520000 is an apocalyptic number.
5001133520000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5001133520000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6439662984150).
5001133520000 is an abundant number, since it is smaller than the sum of its proper divisors (7878192448300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5001133520000 is an equidigital number, since it uses as much as digits as its factorization.
5001133520000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2155724 (or 2155697 counting only the distinct ones).
The product of its (nonzero) digits is 450, while the sum is 20.
Adding to 5001133520000 its reverse (253311005), we get a palindrome (5001386831005).
The spelling of 5001133520000 in words is "five trillion, one billion, one hundred thirty-three million, five hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •