Base | Representation |
---|---|
bin | 100110001010101000110… |
… | …0000011000001001000000 |
3 | 200120110121111000221111022 |
4 | 1030111101200120021000 |
5 | 1141420312230313100 |
6 | 15053432040005012 |
7 | 1050655636444304 |
oct | 114252140301100 |
9 | 20513544027438 |
10 | 5245522510400 |
11 | 1742682785587 |
12 | 70874aa60768 |
13 | 2c085c62b613 |
14 | 141c5566bd04 |
15 | 916ac3e6e85 |
hex | 4c551818240 |
5245522510400 has 84 divisors (see below), whose sum is σ = 12972125236800. Its totient is φ = 2087665113600.
The previous prime is 5245522510367. The next prime is 5245522510409. The reversal of 5245522510400 is 40152255425.
It is a super-2 number, since 2×52455225104002 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5245522510409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7918916 + ... + 8555715.
Almost surely, 25245522510400 is an apocalyptic number.
5245522510400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5245522510400 is an abundant number, since it is smaller than the sum of its proper divisors (7726602726400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5245522510400 is a wasteful number, since it uses less digits than its factorization.
5245522510400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16474852 (or 16474837 counting only the distinct ones).
The product of its (nonzero) digits is 80000, while the sum is 35.
Adding to 5245522510400 its reverse (40152255425), we get a palindrome (5285674765825).
The spelling of 5245522510400 in words is "five trillion, two hundred forty-five billion, five hundred twenty-two million, five hundred ten thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •