Base | Representation |
---|---|
bin | 11001011101111011111110… |
… | …11011101001101010100100 |
3 | 21100021221200010211121102011 |
4 | 30232331333123221222210 |
5 | 24320033113412340044 |
6 | 315035552031124004 |
7 | 14540112460010416 |
oct | 1456757733515244 |
9 | 240257603747364 |
10 | 56004216527524 |
11 | 16932289226031 |
12 | 6345baa973604 |
13 | 25332374c7475 |
14 | db88933d29b6 |
15 | 671be8d8e134 |
hex | 32ef7f6e9aa4 |
56004216527524 has 12 divisors (see below), whose sum is σ = 99856574752284. Its totient is φ = 27473766598304.
The previous prime is 56004216527473. The next prime is 56004216527527. The reversal of 56004216527524 is 42572561240065.
It can be written as a sum of positive squares in 2 ways, for example, as 51705303609600 + 4298912917924 = 7190640^2 + 2073382^2 .
It is not an unprimeable number, because it can be changed into a prime (56004216527527) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 132085416127 + ... + 132085416550.
It is an arithmetic number, because the mean of its divisors is an integer number (8321381229357).
Almost surely, 256004216527524 is an apocalyptic number.
It is an amenable number.
56004216527524 is a deficient number, since it is larger than the sum of its proper divisors (43852358224760).
56004216527524 is a wasteful number, since it uses less digits than its factorization.
56004216527524 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264170832734 (or 264170832732 counting only the distinct ones).
The product of its (nonzero) digits is 4032000, while the sum is 49.
Adding to 56004216527524 its reverse (42572561240065), we get a palindrome (98576777767589).
The spelling of 56004216527524 in words is "fifty-six trillion, four billion, two hundred sixteen million, five hundred twenty-seven thousand, five hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •