Base | Representation |
---|---|
bin | 110100111011111011… |
… | …110010101101110001 |
3 | 12102201021200111110022 |
4 | 310323323302231301 |
5 | 1412402031323232 |
6 | 42040104413225 |
7 | 4051356630206 |
oct | 647373625561 |
9 | 172637614408 |
10 | 56840104817 |
11 | 22118837041 |
12 | b023777215 |
13 | 548abc0b22 |
14 | 2a72d47cad |
15 | 172a127812 |
hex | d3bef2b71 |
56840104817 has 4 divisors (see below), whose sum is σ = 57771909876. Its totient is φ = 55908299760.
The previous prime is 56840104781. The next prime is 56840104819. The reversal of 56840104817 is 71840104865.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 71840104865 = 5 ⋅14368020973.
It can be written as a sum of positive squares in 2 ways, for example, as 5149354081 + 51690750736 = 71759^2 + 227356^2 .
It is a cyclic number.
It is not a de Polignac number, because 56840104817 - 26 = 56840104753 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (56840104819) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 465902438 + ... + 465902559.
It is an arithmetic number, because the mean of its divisors is an integer number (14442977469).
Almost surely, 256840104817 is an apocalyptic number.
It is an amenable number.
56840104817 is a deficient number, since it is larger than the sum of its proper divisors (931805059).
56840104817 is an equidigital number, since it uses as much as digits as its factorization.
56840104817 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 931805058.
The product of its (nonzero) digits is 215040, while the sum is 44.
The spelling of 56840104817 in words is "fifty-six billion, eight hundred forty million, one hundred four thousand, eight hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •