Base | Representation |
---|---|
bin | 100101111111111000000… |
… | …0101000100011001010000 |
3 | 200111020221221122112121202 |
4 | 1023333300011010121100 |
5 | 1141031000230001300 |
6 | 15035050553410332 |
7 | 1046210160063365 |
oct | 113776005043120 |
9 | 20436857575552 |
10 | 5222413125200 |
11 | 17338a4074427 |
12 | 70417b7099a8 |
13 | 2bb6189c0bab |
14 | 140aa242846c |
15 | 90ca86cbad5 |
hex | 4bff0144650 |
5222413125200 has 120 divisors (see below), whose sum is σ = 12570983197248. Its totient is φ = 2084951024640.
The previous prime is 5222413125191. The next prime is 5222413125263. The reversal of 5222413125200 is 25213142225.
It is a happy number.
It is a super-2 number, since 2×52224131252002 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 477494132 + ... + 477505068.
Almost surely, 25222413125200 is an apocalyptic number.
5222413125200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5222413125200 is an abundant number, since it is smaller than the sum of its proper divisors (7348570072048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5222413125200 is a wasteful number, since it uses less digits than its factorization.
5222413125200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13141 (or 13130 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 29.
Adding to 5222413125200 its reverse (25213142225), we get a palindrome (5247626267425).
The spelling of 5222413125200 in words is "five trillion, two hundred twenty-two billion, four hundred thirteen million, one hundred twenty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •