Base | Representation |
---|---|
bin | 100001011100100… |
… | …010010000011001 |
3 | 1110002212021120001 |
4 | 201130202100121 |
5 | 2122122102343 |
6 | 131402533001 |
7 | 16622341033 |
oct | 4134422031 |
9 | 1402767501 |
10 | 561128473 |
11 | 268819144 |
12 | 137b07161 |
13 | 8c3388a9 |
14 | 54748c53 |
15 | 343e044d |
hex | 21722419 |
561128473 has 4 divisors (see below), whose sum is σ = 561202740. Its totient is φ = 561054208.
The previous prime is 561128431. The next prime is 561128479. The reversal of 561128473 is 374821165.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 463454784 + 97673689 = 21528^2 + 9883^2 .
It is a cyclic number.
It is not a de Polignac number, because 561128473 - 229 = 24257561 is a prime.
It is a super-2 number, since 2×5611284732 = 629730326422623458, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (561128479) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24328 + ... + 41401.
It is an arithmetic number, because the mean of its divisors is an integer number (140300685).
Almost surely, 2561128473 is an apocalyptic number.
It is an amenable number.
561128473 is a deficient number, since it is larger than the sum of its proper divisors (74267).
561128473 is an equidigital number, since it uses as much as digits as its factorization.
561128473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74266.
The product of its digits is 40320, while the sum is 37.
The square root of 561128473 is about 23688.1504765568. The cubic root of 561128473 is about 824.8103502851.
The spelling of 561128473 in words is "five hundred sixty-one million, one hundred twenty-eight thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •