Base | Representation |
---|---|
bin | 11000100100110011101010… |
… | …01010010011010011010001 |
3 | 21002100021220020000000200202 |
4 | 30102121311022103103101 |
5 | 24040402432000344131 |
6 | 310534112124424545 |
7 | 14245231260066335 |
oct | 1422316512232321 |
9 | 232307806000622 |
10 | 54041244153041 |
11 | 16245843521352 |
12 | 608967b3a8155 |
13 | 24200b52843a2 |
14 | d4b8784597c5 |
15 | 63ab0b95ebcb |
hex | 3126752934d1 |
54041244153041 has 2 divisors, whose sum is σ = 54041244153042. Its totient is φ = 54041244153040.
The previous prime is 54041244152941. The next prime is 54041244153059. The reversal of 54041244153041 is 14035144214045.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29641447804816 + 24399796348225 = 5444396^2 + 4939615^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-54041244153041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 54041244152986 and 54041244153004.
It is not a weakly prime, because it can be changed into another prime (54041244153341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27020622076520 + 27020622076521.
It is an arithmetic number, because the mean of its divisors is an integer number (27020622076521).
Almost surely, 254041244153041 is an apocalyptic number.
It is an amenable number.
54041244153041 is a deficient number, since it is larger than the sum of its proper divisors (1).
54041244153041 is an equidigital number, since it uses as much as digits as its factorization.
54041244153041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 153600, while the sum is 38.
Adding to 54041244153041 its reverse (14035144214045), we get a palindrome (68076388367086).
The spelling of 54041244153041 in words is "fifty-four trillion, forty-one billion, two hundred forty-four million, one hundred fifty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •