Base | Representation |
---|---|
bin | 1010010000111001… |
… | …11010010010000001 |
3 | 112020000222200121001 |
4 | 11020130322102001 |
5 | 42241142134401 |
6 | 2310445132001 |
7 | 253361344666 |
oct | 51034722201 |
9 | 15200880531 |
10 | 5510505601 |
11 | 237859a467 |
12 | 109955a001 |
13 | 69a851703 |
14 | 3a3bcda6d |
15 | 223b97601 |
hex | 14873a481 |
5510505601 has 2 divisors, whose sum is σ = 5510505602. Its totient is φ = 5510505600.
The previous prime is 5510505587. The next prime is 5510505631. The reversal of 5510505601 is 1065050155.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2756775025 + 2753730576 = 52505^2 + 52476^2 .
It is a cyclic number.
It is not a de Polignac number, because 5510505601 - 225 = 5476951169 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5510505601.
It is not a weakly prime, because it can be changed into another prime (5510505631) 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 as a sum of consecutive naturals, namely, 2755252800 + 2755252801.
It is an arithmetic number, because the mean of its divisors is an integer number (2755252801).
Almost surely, 25510505601 is an apocalyptic number.
It is an amenable number.
5510505601 is a deficient number, since it is larger than the sum of its proper divisors (1).
5510505601 is an equidigital number, since it uses as much as digits as its factorization.
5510505601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3750, while the sum is 28.
The square root of 5510505601 is about 74232.7798280517. The cubic root of 5510505601 is about 1766.2973446846.
Adding to 5510505601 its reverse (1065050155), we get a palindrome (6575555756).
The spelling of 5510505601 in words is "five billion, five hundred ten million, five hundred five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •