Base | Representation |
---|---|
bin | 100001011100011… |
… | …000110011100000 |
3 | 1110002210022110020 |
4 | 201130120303200 |
5 | 2122114333020 |
6 | 131402033440 |
7 | 16622120130 |
oct | 4134306340 |
9 | 1402708406 |
10 | 561089760 |
11 | 2687a2050 |
12 | 137aa8880 |
13 | 8c32409a |
14 | 54738ac0 |
15 | 343d3c40 |
hex | 21718ce0 |
561089760 has 768 divisors, whose sum is σ = 2508226560. Its totient is φ = 101744640.
The previous prime is 561089701. The next prime is 561089803. The reversal of 561089760 is 67980165.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 11938057 + ... + 11938103.
It is an arithmetic number, because the mean of its divisors is an integer number (3265920).
Almost surely, 2561089760 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 561089760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1254113280).
561089760 is an abundant number, since it is smaller than the sum of its proper divisors (1947136800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
561089760 is a wasteful number, since it uses less digits than its factorization.
561089760 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 119 (or 111 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 42.
The square root of 561089760 is about 23687.3333239519. Note that the first 4 decimals coincide. The cubic root of 561089760 is about 824.7913815944.
It can be divided in two parts, 5610 and 89760, that multiplied together give a square (503553600 = 224402).
The spelling of 561089760 in words is "five hundred sixty-one million, eighty-nine thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •