Base | Representation |
---|---|
bin | 100001011100100… |
… | …101110000110001 |
3 | 1110002220000020220 |
4 | 201130211300301 |
5 | 2122123032313 |
6 | 131403123253 |
7 | 16622430636 |
oct | 4134456061 |
9 | 1402800226 |
10 | 561142833 |
11 | 268828a09 |
12 | 137b13529 |
13 | 8c3422a4 |
14 | 5475018d |
15 | 343e4823 |
hex | 21725c31 |
561142833 has 4 divisors (see below), whose sum is σ = 748190448. Its totient is φ = 374095220.
The previous prime is 561142801. The next prime is 561142847. The reversal of 561142833 is 338241165.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 561142833 - 25 = 561142801 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 561142794 and 561142803.
It is not an unprimeable number, because it can be changed into a prime (561142033) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 93523803 + ... + 93523808.
It is an arithmetic number, because the mean of its divisors is an integer number (187047612).
Almost surely, 2561142833 is an apocalyptic number.
It is an amenable number.
561142833 is a deficient number, since it is larger than the sum of its proper divisors (187047615).
561142833 is a wasteful number, since it uses less digits than its factorization.
561142833 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187047614.
The product of its digits is 17280, while the sum is 33.
The square root of 561142833 is about 23688.4535797506. The cubic root of 561142833 is about 824.8173862113.
Adding to 561142833 its reverse (338241165), we get a palindrome (899383998).
The spelling of 561142833 in words is "five hundred sixty-one million, one hundred forty-two thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •