Base | Representation |
---|---|
bin | 10000010110101000011… |
… | …00010001011111000110 |
3 | 1222201101011202220210120 |
4 | 20023110030101133012 |
5 | 33201240332014442 |
6 | 1110045210002410 |
7 | 55411355642520 |
oct | 10132414213706 |
9 | 1881334686716 |
10 | 561905735622 |
11 | 1a7337158980 |
12 | 90a99116406 |
13 | 40cab66937a |
14 | 1d2a6c34a10 |
15 | e93a8284ec |
hex | 82d43117c6 |
561905735622 has 256 divisors, whose sum is σ = 1522378561536. Its totient is φ = 133779456000.
The previous prime is 561905735603. The next prime is 561905735623. The reversal of 561905735622 is 226537509165.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (561905735623) by changing a digit.
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 127 ways as a sum of consecutive naturals, for example, 245051508 + ... + 245053800.
It is an arithmetic number, because the mean of its divisors is an integer number (5946791256).
Almost surely, 2561905735622 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 561905735622, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (761189280768).
561905735622 is an abundant number, since it is smaller than the sum of its proper divisors (960472825914).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
561905735622 is a wasteful number, since it uses less digits than its factorization.
561905735622 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3135.
The product of its (nonzero) digits is 3402000, while the sum is 51.
The spelling of 561905735622 in words is "five hundred sixty-one billion, nine hundred five million, seven hundred thirty-five thousand, six hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •