Base | Representation |
---|---|
bin | 100110001001111011110… |
… | …0000001110001001000000 |
3 | 200120022201020201111001221 |
4 | 1030103313200032021000 |
5 | 1141404214201120000 |
6 | 15053022135404424 |
7 | 1050603342650032 |
oct | 114236740161100 |
9 | 20508636644057 |
10 | 5244012520000 |
11 | 1741a783a1431 |
12 | 7083a9223714 |
13 | 2c067b84bc87 |
14 | 141b50cc7c52 |
15 | 9161ea7761a |
hex | 4c4f780e240 |
5244012520000 has 70 divisors (see below), whose sum is σ = 13003446844718. Its totient is φ = 2097604992000.
The previous prime is 5244012519989. The next prime is 5244012520049. The reversal of 5244012520000 is 252104425.
It can be written as a sum of positive squares in 5 ways, for example, as 898688832064 + 4345323687936 = 947992^2 + 2084544^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
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 9 ways as a sum of consecutive naturals, for example, 65510157 + ... + 65590156.
Almost surely, 25244012520000 is an apocalyptic number.
5244012520000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5244012520000 is an abundant number, since it is smaller than the sum of its proper divisors (7759434324718).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5244012520000 is an equidigital number, since it uses as much as digits as its factorization.
5244012520000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131100345 (or 131100320 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 25.
Adding to 5244012520000 its reverse (252104425), we get a palindrome (5244264624425).
The spelling of 5244012520000 in words is "five trillion, two hundred forty-four billion, twelve million, five hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •