Base | Representation |
---|---|
bin | 10000010101101110000… |
… | …00001101000100000001 |
3 | 1222200010001022102102101 |
4 | 20022313000031010001 |
5 | 33144240001020023 |
6 | 1105524433550401 |
7 | 55363261352620 |
oct | 10126700150401 |
9 | 1880101272371 |
10 | 561416032513 |
11 | 1a7105794766 |
12 | 90981115401 |
13 | 40c3107b00b |
14 | 1d25bb9d6b7 |
15 | e90c8461ad |
hex | 82b700d101 |
561416032513 has 4 divisors (see below), whose sum is σ = 641618322880. Its totient is φ = 481213742148.
The previous prime is 561416032493. The next prime is 561416032531. The reversal of 561416032513 is 315230614165.
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 561416032513 - 213 = 561416024321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (561416032553) 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, 40101145173 + ... + 40101145186.
It is an arithmetic number, because the mean of its divisors is an integer number (160404580720).
Almost surely, 2561416032513 is an apocalyptic number.
It is an amenable number.
561416032513 is a deficient number, since it is larger than the sum of its proper divisors (80202290367).
561416032513 is an equidigital number, since it uses as much as digits as its factorization.
561416032513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80202290366.
The product of its (nonzero) digits is 64800, while the sum is 37.
Adding to 561416032513 its reverse (315230614165), we get a palindrome (876646646678).
The spelling of 561416032513 in words is "five hundred sixty-one billion, four hundred sixteen million, thirty-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •