Base | Representation |
---|---|
bin | 10000010101100111110… |
… | …00011100011011100100 |
3 | 1222122222101202221222100 |
4 | 20022303320130123210 |
5 | 33144133044313120 |
6 | 1105515323332100 |
7 | 55362054302526 |
oct | 10126370343344 |
9 | 1878871687870 |
10 | 561363666660 |
11 | 1a70891784a5 |
12 | 90967681030 |
13 | 40c23274ac4 |
14 | 1d254c4ba16 |
15 | e907e50490 |
hex | 82b3e1c6e4 |
561363666660 has 288 divisors, whose sum is σ = 1824790705920. Its totient is φ = 139265049600.
The previous prime is 561363666623. The next prime is 561363666683. The reversal of 561363666660 is 66666363165.
It is a junction number, because it is equal to n+sod(n) for n = 561363666597 and 561363666606.
It is an unprimeable number.
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 95 ways as a sum of consecutive naturals, for example, 152916625 + ... + 152920295.
It is an arithmetic number, because the mean of its divisors is an integer number (6336078840).
Almost surely, 2561363666660 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 561363666660, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (912395352960).
561363666660 is an abundant number, since it is smaller than the sum of its proper divisors (1263427039260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
561363666660 is a wasteful number, since it uses less digits than its factorization.
561363666660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4499 (or 4494 counting only the distinct ones).
The product of its (nonzero) digits is 12597120, while the sum is 54.
The spelling of 561363666660 in words is "five hundred sixty-one billion, three hundred sixty-three million, six hundred sixty-six thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •