Base | Representation |
---|---|
bin | 1010001111110010… |
… | …01001000111010101 |
3 | 112012101100022112221 |
4 | 11013321021013111 |
5 | 42231242113143 |
6 | 2305512142341 |
7 | 253215553321 |
oct | 50771110725 |
9 | 15171308487 |
10 | 5501129173 |
11 | 2373275851 |
12 | 10963979b1 |
13 | 69891a927 |
14 | 3a286c981 |
15 | 222e442ed |
hex | 147e491d5 |
5501129173 has 2 divisors, whose sum is σ = 5501129174. Its totient is φ = 5501129172.
The previous prime is 5501129171. The next prime is 5501129189. The reversal of 5501129173 is 3719211055.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4774395409 + 726733764 = 69097^2 + 26958^2 .
It is a cyclic number.
It is not a de Polignac number, because 5501129173 - 21 = 5501129171 is a prime.
It is a super-5 number, since 5×55011291735 (a number of 50 digits) contains 55555 as substring.
Together with 5501129171, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5501129171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2750564586 + 2750564587.
It is an arithmetic number, because the mean of its divisors is an integer number (2750564587).
Almost surely, 25501129173 is an apocalyptic number.
It is an amenable number.
5501129173 is a deficient number, since it is larger than the sum of its proper divisors (1).
5501129173 is an equidigital number, since it uses as much as digits as its factorization.
5501129173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9450, while the sum is 34.
The square root of 5501129173 is about 74169.5973630705. The cubic root of 5501129173 is about 1765.2949586099.
The spelling of 5501129173 in words is "five billion, five hundred one million, one hundred twenty-nine thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.188 sec. • engine limits •