Base | Representation |
---|---|
bin | 11001100100110101011111… |
… | …10100101101100000011111 |
3 | 21101010121111112011010122121 |
4 | 30302122233310231200133 |
5 | 24332424040402321021 |
6 | 315340512503323411 |
7 | 14563203433635001 |
oct | 1462325764554037 |
9 | 241117445133577 |
10 | 56241251604511 |
11 | 16a13865362776 |
12 | 6383b21450567 |
13 | 254c6b154647c |
14 | dc613bdaa371 |
15 | 677e6d884741 |
hex | 3326afd2d81f |
56241251604511 has 4 divisors (see below), whose sum is σ = 56246370506152. Its totient is φ = 56236132702872.
The previous prime is 56241251604491. The next prime is 56241251604523. The reversal of 56241251604511 is 11540615214265.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 56241251604511 - 25 = 56241251604479 is a prime.
It is a super-2 number, since 2×562412516045112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56241251604611) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2559434340 + ... + 2559456313.
It is an arithmetic number, because the mean of its divisors is an integer number (14061592626538).
Almost surely, 256241251604511 is an apocalyptic number.
56241251604511 is a deficient number, since it is larger than the sum of its proper divisors (5118901641).
56241251604511 is a wasteful number, since it uses less digits than its factorization.
56241251604511 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5118901640.
The product of its (nonzero) digits is 288000, while the sum is 43.
Adding to 56241251604511 its reverse (11540615214265), we get a palindrome (67781866818776).
The spelling of 56241251604511 in words is "fifty-six trillion, two hundred forty-one billion, two hundred fifty-one million, six hundred four thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •