Base | Representation |
---|---|
bin | 11000100110100010001000… |
… | …00100101000011000011001 |
3 | 21002112221222100122120001201 |
4 | 30103101010010220120121 |
5 | 24042340411313000311 |
6 | 311021241041314201 |
7 | 14252431031405035 |
oct | 1423210404503031 |
9 | 232487870576051 |
10 | 54100550125081 |
11 | 16268a07168989 |
12 | 6099070935961 |
13 | 2425876cb3535 |
14 | d506a2a8b1c5 |
15 | 63c42d2be9c1 |
hex | 313444128619 |
54100550125081 has 2 divisors, whose sum is σ = 54100550125082. Its totient is φ = 54100550125080.
The previous prime is 54100550125067. The next prime is 54100550125093. The reversal of 54100550125081 is 18052105500145.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 53701284109456 + 399266015625 = 7328116^2 + 631875^2 .
It is a cyclic number.
It is not a de Polignac number, because 54100550125081 - 25 = 54100550125049 is a prime.
It is a super-2 number, since 2×541005501250812 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 54100550125081.
It is not a weakly prime, because it can be changed into another prime (54100550125031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27050275062540 + 27050275062541.
It is an arithmetic number, because the mean of its divisors is an integer number (27050275062541).
Almost surely, 254100550125081 is an apocalyptic number.
It is an amenable number.
54100550125081 is a deficient number, since it is larger than the sum of its proper divisors (1).
54100550125081 is an equidigital number, since it uses as much as digits as its factorization.
54100550125081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 40000, while the sum is 37.
The spelling of 54100550125081 in words is "fifty-four trillion, one hundred billion, five hundred fifty million, one hundred twenty-five thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •