Base | Representation |
---|---|
bin | 100001011101100… |
… | …110100000000000 |
3 | 1110010101110222220 |
4 | 201131212200000 |
5 | 2122210024000 |
6 | 131412531040 |
7 | 16624614006 |
oct | 4135464000 |
9 | 1403343886 |
10 | 561408000 |
11 | 26899a15a |
12 | 138020a80 |
13 | 8c405baa |
14 | 547bca76 |
15 | 344481a0 |
hex | 21766800 |
561408000 has 384 divisors, whose sum is σ = 2023781760. Its totient is φ = 137625600.
The previous prime is 561407981. The next prime is 561408041. The reversal of 561408000 is 804165.
It is a tau number, because it is divible by the number of its divisors (384).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13055979 + ... + 13056021.
It is an arithmetic number, because the mean of its divisors is an integer number (5270265).
Almost surely, 2561408000 is an apocalyptic number.
561408000 is a gapful number since it is divisible by the number (50) 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 561408000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1011890880).
561408000 is an abundant number, since it is smaller than the sum of its proper divisors (1462373760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
561408000 is a wasteful number, since it uses less digits than its factorization.
561408000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100 (or 70 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 24.
The square root of 561408000 is about 23694.0498859946. The cubic root of 561408000 is about 824.9472877248.
The spelling of 561408000 in words is "five hundred sixty-one million, four hundred eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •