Base | Representation |
---|---|
bin | 110011010001010000… |
… | …010001100101101001 |
3 | 12021002112212121022222 |
4 | 303101100101211221 |
5 | 1400220334441131 |
6 | 41142331123425 |
7 | 3656124634364 |
oct | 632120214551 |
9 | 167075777288 |
10 | 55050312041 |
11 | 2138a51425a |
12 | a8042a3575 |
13 | 5264165a4a |
14 | 294336b0db |
15 | 1672e3887b |
hex | cd1411969 |
55050312041 has 2 divisors, whose sum is σ = 55050312042. Its totient is φ = 55050312040.
The previous prime is 55050312007. The next prime is 55050312043. The reversal of 55050312041 is 14021305055.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28326236416 + 26724075625 = 168304^2 + 163475^2 .
It is a cyclic number.
It is not a de Polignac number, because 55050312041 - 26 = 55050311977 is a prime.
It is a super-2 number, since 2×550503120412 (a number of 22 digits) contains 22 as substring.
Together with 55050312043, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 55050312041.
It is not a weakly prime, because it can be changed into another prime (55050312043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27525156020 + 27525156021.
It is an arithmetic number, because the mean of its divisors is an integer number (27525156021).
Almost surely, 255050312041 is an apocalyptic number.
It is an amenable number.
55050312041 is a deficient number, since it is larger than the sum of its proper divisors (1).
55050312041 is an equidigital number, since it uses as much as digits as its factorization.
55050312041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3000, while the sum is 26.
Adding to 55050312041 its reverse (14021305055), we get a palindrome (69071617096).
The spelling of 55050312041 in words is "fifty-five billion, fifty million, three hundred twelve thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •