Base | Representation |
---|---|
bin | 10000010101100010111… |
… | …10100000011101110011 |
3 | 1222122212120211210011202 |
4 | 20022301132200131303 |
5 | 33144042232004021 |
6 | 1105511322401415 |
7 | 55361054302436 |
oct | 10126136403563 |
9 | 1878776753152 |
10 | 561323313011 |
11 | 1a706841617a |
12 | 9095606026b |
13 | 40c17ab62c6 |
14 | 1d24d74581d |
15 | e90462da0b |
hex | 82b17a0773 |
561323313011 has 8 divisors (see below), whose sum is σ = 578339521344. Its totient is φ = 544518486400.
The previous prime is 561323312971. The next prime is 561323313049. The reversal of 561323313011 is 110313323165.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 561323313011 - 218 = 561323050867 is a prime.
It is a super-2 number, since 2×5613233130112 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (561323313311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 52840040 + ... + 52850661.
It is an arithmetic number, because the mean of its divisors is an integer number (72292440168).
Almost surely, 2561323313011 is an apocalyptic number.
561323313011 is a deficient number, since it is larger than the sum of its proper divisors (17016208333).
561323313011 is a wasteful number, since it uses less digits than its factorization.
561323313011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105690861.
The product of its (nonzero) digits is 4860, while the sum is 29.
Adding to 561323313011 its reverse (110313323165), we get a palindrome (671636636176).
The spelling of 561323313011 in words is "five hundred sixty-one billion, three hundred twenty-three million, three hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •