Base | Representation |
---|---|
bin | 10000010101001001101… |
… | …00111110110001010101 |
3 | 1222122022210112021100011 |
4 | 20022210310332301111 |
5 | 33143123420204001 |
6 | 1105434302120221 |
7 | 55352566442200 |
oct | 10124464766125 |
9 | 1878283467304 |
10 | 561111100501 |
11 | 1a6a69651836 |
12 | 908b6b80071 |
13 | 40bb2b44383 |
14 | 1d22d4a4937 |
15 | e8e0bb0d51 |
hex | 82a4d3ec55 |
561111100501 has 6 divisors (see below), whose sum is σ = 652721076150. Its totient is φ = 480952371816.
The previous prime is 561111100499. The next prime is 561111100507. The reversal of 561111100501 is 105001111165.
It can be written as a sum of positive squares in only one way, i.e., 558173352100 + 2937748401 = 747110^2 + 54201^2 .
It is not a de Polignac number, because 561111100501 - 21 = 561111100499 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 (561111100507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5725623426 + ... + 5725623523.
It is an arithmetic number, because the mean of its divisors is an integer number (108786846025).
Almost surely, 2561111100501 is an apocalyptic number.
It is an amenable number.
561111100501 is a deficient number, since it is larger than the sum of its proper divisors (91609975649).
561111100501 is a wasteful number, since it uses less digits than its factorization.
561111100501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11451246963 (or 11451246956 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 22.
Adding to 561111100501 its reverse (105001111165), we get a palindrome (666112211666).
The spelling of 561111100501 in words is "five hundred sixty-one billion, one hundred eleven million, one hundred thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •