Base | Representation |
---|---|
bin | 10000001101101100111… |
… | …10111100111101110111 |
3 | 1222021000010011121212111 |
4 | 20012312132330331313 |
5 | 33111431230123120 |
6 | 1103533415031451 |
7 | 55151522554201 |
oct | 10066636747567 |
9 | 1867003147774 |
10 | 557112348535 |
11 | 1a52a7440246 |
12 | 8bb7b96b587 |
13 | 406c656ba52 |
14 | 1cd70397771 |
15 | e759ad575a |
hex | 81b67bcf77 |
557112348535 has 4 divisors (see below), whose sum is σ = 668534818248. Its totient is φ = 445689878824.
The previous prime is 557112348509. The next prime is 557112348539. The reversal of 557112348535 is 535843211755.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 535843211755 = 5 ⋅107168642351.
It is a cyclic number.
It is not a de Polignac number, because 557112348535 - 27 = 557112348407 is a prime.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (557112348539) 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, 55711234849 + ... + 55711234858.
It is an arithmetic number, because the mean of its divisors is an integer number (167133704562).
Almost surely, 2557112348535 is an apocalyptic number.
557112348535 is a deficient number, since it is larger than the sum of its proper divisors (111422469713).
557112348535 is a wasteful number, since it uses less digits than its factorization.
557112348535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111422469712.
The product of its digits is 2520000, while the sum is 49.
The spelling of 557112348535 in words is "five hundred fifty-seven billion, one hundred twelve million, three hundred forty-eight thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •