Base | Representation |
---|---|
bin | 100001011101110… |
… | …111001100000000 |
3 | 1110010111221202110 |
4 | 201131313030000 |
5 | 2122214220402 |
6 | 131414215320 |
7 | 16625320203 |
oct | 4135671400 |
9 | 1403457673 |
10 | 561476352 |
11 | 268a36548 |
12 | 138054540 |
13 | 8c42b038 |
14 | 547d993a |
15 | 3445d56c |
hex | 21777300 |
561476352 has 72 divisors (see below), whose sum is σ = 1509951856. Its totient is φ = 185204736.
The previous prime is 561476317. The next prime is 561476387. The reversal of 561476352 is 253674165.
It is an interprime number because it is at equal distance from previous prime (561476317) and next prime (561476387).
It is a self number, because there is not a number n which added to its sum of digits gives 561476352.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 70728 + ... + 78264.
Almost surely, 2561476352 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 561476352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (754975928).
561476352 is an abundant number, since it is smaller than the sum of its proper divisors (948475504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
561476352 is an equidigital number, since it uses as much as digits as its factorization.
561476352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7653 (or 7639 counting only the distinct ones).
The product of its digits is 151200, while the sum is 39.
The square root of 561476352 is about 23695.4922295360. The cubic root of 561476352 is about 824.9807657591.
The spelling of 561476352 in words is "five hundred sixty-one million, four hundred seventy-six thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •