Base | Representation |
---|---|
bin | 100001011110100… |
… | …000101101111000 |
3 | 1110010211121002121 |
4 | 201132200231320 |
5 | 2122240141311 |
6 | 131422011024 |
7 | 16626626140 |
oct | 4136405570 |
9 | 1403747077 |
10 | 561646456 |
11 | 269042328 |
12 | 138116a74 |
13 | 8c48a5a7 |
14 | 54841920 |
15 | 34493b71 |
hex | 217a0b78 |
561646456 has 64 divisors (see below), whose sum is σ = 1224000000. Its totient is φ = 236649600.
The previous prime is 561646447. The next prime is 561646469. The reversal of 561646456 is 654646165.
It is a super-3 number, since 3×5616464563 (a number of 27 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1125295 + ... + 1125793.
It is an arithmetic number, because the mean of its divisors is an integer number (19125000).
Almost surely, 2561646456 is an apocalyptic number.
561646456 is a gapful number since it is divisible by the number (56) 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 561646456, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (612000000).
561646456 is an abundant number, since it is smaller than the sum of its proper divisors (662353544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
561646456 is a wasteful number, since it uses less digits than its factorization.
561646456 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 812 (or 808 counting only the distinct ones).
The product of its digits is 518400, while the sum is 43.
The square root of 561646456 is about 23699.0813324061. The cubic root of 561646456 is about 825.0640689760.
The spelling of 561646456 in words is "five hundred sixty-one million, six hundred forty-six thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •