Base | Representation |
---|---|
bin | 100001011100101… |
… | …011001110100101 |
3 | 1110002221010222002 |
4 | 201130223032211 |
5 | 2122124241341 |
6 | 131403415045 |
7 | 16622553131 |
oct | 4134531645 |
9 | 1402833862 |
10 | 561165221 |
11 | 268843811 |
12 | 137b24485 |
13 | 8c34c536 |
14 | 547583c1 |
15 | 343eb29b |
hex | 2172b3a5 |
561165221 has 4 divisors (see below), whose sum is σ = 561966444. Its totient is φ = 560364000.
The previous prime is 561165217. The next prime is 561165233. The reversal of 561165221 is 122561165.
It is a happy number.
561165221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 308704900 + 252460321 = 17570^2 + 15889^2 .
It is a cyclic number.
It is not a de Polignac number, because 561165221 - 22 = 561165217 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (561165251) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 399560 + ... + 400961.
It is an arithmetic number, because the mean of its divisors is an integer number (140491611).
Almost surely, 2561165221 is an apocalyptic number.
It is an amenable number.
561165221 is a deficient number, since it is larger than the sum of its proper divisors (801223).
561165221 is an equidigital number, since it uses as much as digits as its factorization.
561165221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 801222.
The product of its digits is 3600, while the sum is 29.
The square root of 561165221 is about 23688.9261259349. The cubic root of 561165221 is about 824.8283553532.
The spelling of 561165221 in words is "five hundred sixty-one million, one hundred sixty-five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •