Base | Representation |
---|---|
bin | 100111010011001001111… |
… | …1001000100000010001101 |
3 | 201010100120202101012200211 |
4 | 1032212103321010002031 |
5 | 1201443232301204212 |
6 | 15253145145522421 |
7 | 1065141064561351 |
oct | 116462371040215 |
9 | 21110522335624 |
10 | 5401255100557 |
11 | 17a272876a548 |
12 | 7329714a3411 |
13 | 30244a749954 |
14 | 1495ca4dd461 |
15 | 957743db9a7 |
hex | 4e993e4408d |
5401255100557 has 2 divisors, whose sum is σ = 5401255100558. Its totient is φ = 5401255100556.
The previous prime is 5401255100543. The next prime is 5401255100561. The reversal of 5401255100557 is 7550015521045.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5330806793316 + 70448307241 = 2308854^2 + 265421^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5401255100557 is a prime.
It is a super-2 number, since 2×54012551005572 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5401255100537) 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 as a sum of consecutive naturals, namely, 2700627550278 + 2700627550279.
It is an arithmetic number, because the mean of its divisors is an integer number (2700627550279).
Almost surely, 25401255100557 is an apocalyptic number.
It is an amenable number.
5401255100557 is a deficient number, since it is larger than the sum of its proper divisors (1).
5401255100557 is an equidigital number, since it uses as much as digits as its factorization.
5401255100557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 175000, while the sum is 40.
The spelling of 5401255100557 in words is "five trillion, four hundred one billion, two hundred fifty-five million, one hundred thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •