Base | Representation |
---|---|
bin | 100100111000101101011… |
… | …1000001100110011000000 |
3 | 122221122111011121211011020 |
4 | 1021301122320030303000 |
5 | 1131030003014404300 |
6 | 14440534035545440 |
7 | 1032160032530451 |
oct | 111613270146300 |
9 | 18848434554136 |
10 | 5069586091200 |
11 | 1684aaa203844 |
12 | 69a62a15b280 |
13 | 2aa0a183a567 |
14 | 137525417128 |
15 | 8bd118228a0 |
hex | 49c5ae0ccc0 |
5069586091200 has 336 divisors, whose sum is σ = 17183270200320. Its totient is φ = 1307192832000.
The previous prime is 5069586091187. The next prime is 5069586091201. The reversal of 5069586091200 is 21906859605.
It is not an unprimeable number, because it can be changed into a prime (5069586091201) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 187325670 + ... + 187352730.
It is an arithmetic number, because the mean of its divisors is an integer number (51140685120).
Almost surely, 25069586091200 is an apocalyptic number.
5069586091200 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 5069586091200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8591635100160).
5069586091200 is an abundant number, since it is smaller than the sum of its proper divisors (12113684109120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5069586091200 is a wasteful number, since it uses less digits than its factorization.
5069586091200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28376 (or 28361 counting only the distinct ones).
The product of its (nonzero) digits is 1166400, while the sum is 51.
The spelling of 5069586091200 in words is "five trillion, sixty-nine billion, five hundred eighty-six million, ninety-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •