Base | Representation |
---|---|
bin | 110100010000001011… |
… | …010011111110001001 |
3 | 12100211010021212121121 |
4 | 310100023103332021 |
5 | 1404401112210224 |
6 | 41435201435241 |
7 | 4024233632101 |
oct | 642013237611 |
9 | 170733255547 |
10 | 56105975689 |
11 | 218813a6a55 |
12 | aa5993bb21 |
13 | 53a1a921aa |
14 | 2a03648201 |
15 | 16d5962be4 |
hex | d102d3f89 |
56105975689 has 3 divisors (see below), whose sum is σ = 56106212557. Its totient is φ = 56105738822.
The previous prime is 56105975683. The next prime is 56105975699. The reversal of 56105975689 is 98657950165.
The square root of 56105975689 is 236867.
It is a perfect power (a square), and thus also a powerful number.
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.
It is not a de Polignac number, because 56105975689 - 213 = 56105967497 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (56105975683) by changing a digit.
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 2 ways as a sum of consecutive naturals, for example, 118434 + ... + 355300.
Almost surely, 256105975689 is an apocalyptic number.
56105975689 is the 236867-th square number.
56105975689 is the 118434-th centered octagonal number.
It is an amenable number.
56105975689 is a deficient number, since it is larger than the sum of its proper divisors (236868).
56105975689 is an frugal number, since it uses more digits than its factorization.
56105975689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 473734 (or 236867 counting only the distinct ones).
The product of its (nonzero) digits is 20412000, while the sum is 61.
The spelling of 56105975689 in words is "fifty-six billion, one hundred five million, nine hundred seventy-five thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •