Base | Representation |
---|---|
bin | 11000100110111010010111… |
… | …00110100011111011001001 |
3 | 21002121012120010120212211212 |
4 | 30103131023212203323021 |
5 | 24043044033202041441 |
6 | 311031232113302505 |
7 | 14253401332163522 |
oct | 1423351346437311 |
9 | 232535503525755 |
10 | 54113561362121 |
11 | 16273483718948 |
12 | 609b6a2264a35 |
13 | 2426b6b7bab71 |
14 | d51178add849 |
15 | 63c9406e0eeb |
hex | 31374b9a3ec9 |
54113561362121 has 2 divisors, whose sum is σ = 54113561362122. Its totient is φ = 54113561362120.
The previous prime is 54113561362117. The next prime is 54113561362123. The reversal of 54113561362121 is 12126316531145.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 42813610190521 + 11299951171600 = 6543211^2 + 3361540^2 .
It is a cyclic number.
It is not a de Polignac number, because 54113561362121 - 22 = 54113561362117 is a prime.
Together with 54113561362123, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (54113561362123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27056780681060 + 27056780681061.
It is an arithmetic number, because the mean of its divisors is an integer number (27056780681061).
Almost surely, 254113561362121 is an apocalyptic number.
It is an amenable number.
54113561362121 is a deficient number, since it is larger than the sum of its proper divisors (1).
54113561362121 is an equidigital number, since it uses as much as digits as its factorization.
54113561362121 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 129600, while the sum is 41.
Adding to 54113561362121 its reverse (12126316531145), we get a palindrome (66239877893266).
The spelling of 54113561362121 in words is "fifty-four trillion, one hundred thirteen billion, five hundred sixty-one million, three hundred sixty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •