Base | Representation |
---|---|
bin | 10000010101001000011… |
… | …10101001010011011100 |
3 | 1222122022002121201011010 |
4 | 20022210032221103130 |
5 | 33143113332113400 |
6 | 1105433302455220 |
7 | 55352415145512 |
oct | 10124416512334 |
9 | 1878262551133 |
10 | 561101051100 |
11 | 1a6a63a08547 |
12 | 908b3734510 |
13 | 40bb0a36195 |
14 | 1d22c00a4b2 |
15 | e8ded78450 |
hex | 82a43a94dc |
561101051100 has 36 divisors (see below), whose sum is σ = 1623452375384. Its totient is φ = 149626946880.
The previous prime is 561101051083. The next prime is 561101051221. The reversal of 561101051100 is 1150101165.
It is a happy number.
It is a super-2 number, since 2×5611010511002 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 935168119 + ... + 935168718.
Almost surely, 2561101051100 is an apocalyptic number.
561101051100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
561101051100 is an abundant number, since it is smaller than the sum of its proper divisors (1062351324284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
561101051100 is a wasteful number, since it uses less digits than its factorization.
561101051100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1870336854 (or 1870336847 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 561101051100 its reverse (1150101165), we get a palindrome (562251152265).
The spelling of 561101051100 in words is "five hundred sixty-one billion, one hundred one million, fifty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •