Base | Representation |
---|---|
bin | 100111101100010000000… |
… | …0111111001001011100101 |
3 | 201022111200121020222200111 |
4 | 1033120200013321023211 |
5 | 1203334120213443203 |
6 | 15334020553013021 |
7 | 1102056431610502 |
oct | 117304007711345 |
9 | 21274617228614 |
10 | 5455147406053 |
11 | 181357354a2a4 |
12 | 7412b19b4171 |
13 | 307558a02207 |
14 | 14c05db4c4a9 |
15 | 96d7a83226d |
hex | 4f6201f92e5 |
5455147406053 has 2 divisors, whose sum is σ = 5455147406054. Its totient is φ = 5455147406052.
The previous prime is 5455147406017. The next prime is 5455147406063. The reversal of 5455147406053 is 3506047415545.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4118147779684 + 1336999626369 = 2029322^2 + 1156287^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5455147406053 is a prime.
It is a super-2 number, since 2×54551474060532 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5455147405988 and 5455147406006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5455147406003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2727573703026 + 2727573703027.
It is an arithmetic number, because the mean of its divisors is an integer number (2727573703027).
Almost surely, 25455147406053 is an apocalyptic number.
It is an amenable number.
5455147406053 is a deficient number, since it is larger than the sum of its proper divisors (1).
5455147406053 is an equidigital number, since it uses as much as digits as its factorization.
5455147406053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040000, while the sum is 49.
The spelling of 5455147406053 in words is "five trillion, four hundred fifty-five billion, one hundred forty-seven million, four hundred six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •