Base | Representation |
---|---|
bin | 100111111000001011101… |
… | …1100010110100100101101 |
3 | 201101221211101122210122202 |
4 | 1033300113130112210231 |
5 | 1204244110011000112 |
6 | 15353455351551245 |
7 | 1103654425514561 |
oct | 117602734264455 |
9 | 21357741583582 |
10 | 5480771578157 |
11 | 1823422744037 |
12 | 74626338b525 |
13 | 309ab0648725 |
14 | 14d3b0d716a1 |
15 | 9787a1e96c2 |
hex | 4fc1771692d |
5480771578157 has 2 divisors, whose sum is σ = 5480771578158. Its totient is φ = 5480771578156.
The previous prime is 5480771578123. The next prime is 5480771578169. The reversal of 5480771578157 is 7518751770845.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3899890334596 + 1580881243561 = 1974814^2 + 1257331^2 .
It is a cyclic number.
It is not a de Polignac number, because 5480771578157 - 28 = 5480771577901 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5480771578093 and 5480771578102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5480771571157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2740385789078 + 2740385789079.
It is an arithmetic number, because the mean of its divisors is an integer number (2740385789079).
Almost surely, 25480771578157 is an apocalyptic number.
It is an amenable number.
5480771578157 is a deficient number, since it is larger than the sum of its proper divisors (1).
5480771578157 is an equidigital number, since it uses as much as digits as its factorization.
5480771578157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 76832000, while the sum is 65.
The spelling of 5480771578157 in words is "five trillion, four hundred eighty billion, seven hundred seventy-one million, five hundred seventy-eight thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •