Base | Representation |
---|---|
bin | 10000001101100110010… |
… | …10101111110010001101 |
3 | 1222020212020111101212212 |
4 | 20012303022233302031 |
5 | 33111323010020023 |
6 | 1103524110440205 |
7 | 55150245665003 |
oct | 10066312576215 |
9 | 1866766441785 |
10 | 557056720013 |
11 | 1a5278aa5762 |
12 | 8bb65203065 |
13 | 406b7b92771 |
14 | 1cd66c36a73 |
15 | e754c97e78 |
hex | 81b32afc8d |
557056720013 has 4 divisors (see below), whose sum is σ = 557136568860. Its totient is φ = 556976871168.
The previous prime is 557056720009. The next prime is 557056720021. The reversal of 557056720013 is 310027650755.
557056720013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 262622426089 + 294434293924 = 512467^2 + 542618^2 .
It is a cyclic number.
It is not a de Polignac number, because 557056720013 - 22 = 557056720009 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (557056720043) 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, 39913958 + ... + 39927911.
It is an arithmetic number, because the mean of its divisors is an integer number (139284142215).
Almost surely, 2557056720013 is an apocalyptic number.
It is an amenable number.
557056720013 is a deficient number, since it is larger than the sum of its proper divisors (79848847).
557056720013 is an equidigital number, since it uses as much as digits as its factorization.
557056720013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79848846.
The product of its (nonzero) digits is 220500, while the sum is 41.
The spelling of 557056720013 in words is "five hundred fifty-seven billion, fifty-six million, seven hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •