Base | Representation |
---|---|
bin | 10000010101001000110… |
… | …01101100010001010000 |
3 | 1222122022022001211100110 |
4 | 20022210121230101100 |
5 | 33143120102244312 |
6 | 1105433444521320 |
7 | 55352451566052 |
oct | 10124431542120 |
9 | 1878268054313 |
10 | 561103946832 |
11 | 1a6a65606110 |
12 | 908b46b0240 |
13 | 40bb150b230 |
14 | 1d22c5618d2 |
15 | e8e024b43c |
hex | 82a466c450 |
561103946832 has 320 divisors, whose sum is σ = 1754271719424. Its totient is φ = 152246200320.
The previous prime is 561103946831. The next prime is 561103946933. The reversal of 561103946832 is 238649301165.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (561103946831) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 88123713 + ... + 88130079.
Almost surely, 2561103946832 is an apocalyptic number.
561103946832 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 561103946832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (877135859712).
561103946832 is an abundant number, since it is smaller than the sum of its proper divisors (1193167772592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
561103946832 is a wasteful number, since it uses less digits than its factorization.
561103946832 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6786 (or 6780 counting only the distinct ones).
The product of its (nonzero) digits is 933120, while the sum is 48.
The spelling of 561103946832 in words is "five hundred sixty-one billion, one hundred three million, nine hundred forty-six thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •