Base | Representation |
---|---|
bin | 100001011100100… |
… | …110101010000110 |
3 | 1110002220012021210 |
4 | 201130212222012 |
5 | 2122123142002 |
6 | 131403152250 |
7 | 16622444430 |
oct | 4134465206 |
9 | 1402805253 |
10 | 561146502 |
11 | 268830744 |
12 | 137b15686 |
13 | 8c343b67 |
14 | 54751650 |
15 | 343e596c |
hex | 21726a86 |
561146502 has 64 divisors (see below), whose sum is σ = 1347600384. Its totient is φ = 152301600.
The previous prime is 561146471. The next prime is 561146527. The reversal of 561146502 is 205641165.
It is a self number, because there is not a number n which added to its sum of digits gives 561146502.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 143943 + ... + 147789.
It is an arithmetic number, because the mean of its divisors is an integer number (21056256).
Almost surely, 2561146502 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 561146502, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (673800192).
561146502 is an abundant number, since it is smaller than the sum of its proper divisors (786453882).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
561146502 is a wasteful number, since it uses less digits than its factorization.
561146502 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4033.
The product of its (nonzero) digits is 7200, while the sum is 30.
The square root of 561146502 is about 23688.5310224167. The cubic root of 561146502 is about 824.8191838810.
Adding to 561146502 its reverse (205641165), we get a palindrome (766787667).
The spelling of 561146502 in words is "five hundred sixty-one million, one hundred forty-six thousand, five hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •