Base | Representation |
---|---|
bin | 110100101110011010… |
… | …010101101011100011 |
3 | 12102010110210010112121 |
4 | 310232122111223203 |
5 | 1411420441400311 |
6 | 42001402005111 |
7 | 4042633345366 |
oct | 645632255343 |
9 | 172113703477 |
10 | 56613231331 |
11 | 22011769698 |
12 | ab7b7a6797 |
13 | 5452bb7967 |
14 | 2a50b6c0dd |
15 | 1715260b71 |
hex | d2e695ae3 |
56613231331 has 4 divisors (see below), whose sum is σ = 56613871512. Its totient is φ = 56612591152.
The previous prime is 56613231317. The next prime is 56613231391. The reversal of 56613231331 is 13313231665.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 13313231665 = 5 ⋅2662646333.
It is a cyclic number.
It is not a de Polignac number, because 56613231331 - 219 = 56612707043 is a prime.
It is a super-2 number, since 2×566132313312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (56613231391) 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, 161125 + ... + 373078.
It is an arithmetic number, because the mean of its divisors is an integer number (14153467878).
Almost surely, 256613231331 is an apocalyptic number.
56613231331 is a deficient number, since it is larger than the sum of its proper divisors (640181).
56613231331 is a wasteful number, since it uses less digits than its factorization.
56613231331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 640180.
The product of its digits is 29160, while the sum is 34.
Adding to 56613231331 its reverse (13313231665), we get a palindrome (69926462996).
The spelling of 56613231331 in words is "fifty-six billion, six hundred thirteen million, two hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •