Base | Representation |
---|---|
bin | 1010010000001100… |
… | …01001111101100001 |
3 | 112012121202122000212 |
4 | 11020012021331201 |
5 | 42233130244023 |
6 | 2310113223505 |
7 | 253256552033 |
oct | 51006117541 |
9 | 15177678025 |
10 | 5504540513 |
11 | 237519583a |
12 | 1097561b95 |
13 | 699543584 |
14 | 3a30b9c53 |
15 | 2233b9e78 |
hex | 148189f61 |
5504540513 has 4 divisors (see below), whose sum is σ = 5682106368. Its totient is φ = 5326974660.
The previous prime is 5504540473. The next prime is 5504540519. The reversal of 5504540513 is 3150454055.
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 5504540513 - 220 = 5503491937 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5504540513.
It is not an unprimeable number, because it can be changed into a prime (5504540519) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 88782881 + ... + 88782942.
It is an arithmetic number, because the mean of its divisors is an integer number (1420526592).
Almost surely, 25504540513 is an apocalyptic number.
It is an amenable number.
5504540513 is a deficient number, since it is larger than the sum of its proper divisors (177565855).
5504540513 is a wasteful number, since it uses less digits than its factorization.
5504540513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 177565854.
The product of its (nonzero) digits is 30000, while the sum is 32.
The square root of 5504540513 is about 74192.5906880195. The cubic root of 5504540513 is about 1765.6597792833.
Adding to 5504540513 its reverse (3150454055), we get a palindrome (8654994568).
The spelling of 5504540513 in words is "five billion, five hundred four million, five hundred forty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •