Base | Representation |
---|---|
bin | 11000100110111011010010… |
… | …10111000110101011010001 |
3 | 21002121020211221001011000101 |
4 | 30103131221113012223101 |
5 | 24043101044010023031 |
6 | 311031353430252401 |
7 | 14253416603645311 |
oct | 1423355127065321 |
9 | 232536757034011 |
10 | 54114060626641 |
11 | 1627370a522754 |
12 | 609b8014b7101 |
13 | 2426c1b076262 |
14 | d511c5143441 |
15 | 63c96e461361 |
hex | 3137695c6ad1 |
54114060626641 has 2 divisors, whose sum is σ = 54114060626642. Its totient is φ = 54114060626640.
The previous prime is 54114060626567. The next prime is 54114060626693. The reversal of 54114060626641 is 14662606041145.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30312688444416 + 23801372182225 = 5505696^2 + 4878665^2 .
It is a cyclic number.
It is not a de Polignac number, because 54114060626641 - 223 = 54114052238033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 54114060626591 and 54114060626600.
It is not a weakly prime, because it can be changed into another prime (54114060626141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27057030313320 + 27057030313321.
It is an arithmetic number, because the mean of its divisors is an integer number (27057030313321).
Almost surely, 254114060626641 is an apocalyptic number.
It is an amenable number.
54114060626641 is a deficient number, since it is larger than the sum of its proper divisors (1).
54114060626641 is an equidigital number, since it uses as much as digits as its factorization.
54114060626641 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 829440, while the sum is 46.
Adding to 54114060626641 its reverse (14662606041145), we get a palindrome (68776666667786).
The spelling of 54114060626641 in words is "fifty-four trillion, one hundred fourteen billion, sixty million, six hundred twenty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •