Base | Representation |
---|---|
bin | 1001010111001101… |
… | …01001110111110001 |
3 | 110222022021200221012 |
4 | 10223212221313301 |
5 | 40243242124221 |
6 | 2150435440305 |
7 | 235363501616 |
oct | 45346516761 |
9 | 13868250835 |
10 | 5026520561 |
11 | 214a381327 |
12 | b83456095 |
13 | 6214b5c2a |
14 | 35980650d |
15 | 1e644465b |
hex | 12b9a9df1 |
5026520561 has 4 divisors (see below), whose sum is σ = 5143416432. Its totient is φ = 4909624692.
The previous prime is 5026520557. The next prime is 5026520581. The reversal of 5026520561 is 1650256205.
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 5026520561 - 22 = 5026520557 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5026520531) 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 3 ways as a sum of consecutive naturals, for example, 58447871 + ... + 58447956.
It is an arithmetic number, because the mean of its divisors is an integer number (1285854108).
Almost surely, 25026520561 is an apocalyptic number.
It is an amenable number.
5026520561 is a deficient number, since it is larger than the sum of its proper divisors (116895871).
5026520561 is a wasteful number, since it uses less digits than its factorization.
5026520561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116895870.
The product of its (nonzero) digits is 18000, while the sum is 32.
The square root of 5026520561 is about 70897.9587929018. The cubic root of 5026520561 is about 1712.9939184892.
Adding to 5026520561 its reverse (1650256205), we get a palindrome (6676776766).
The spelling of 5026520561 in words is "five billion, twenty-six million, five hundred twenty thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •