Base | Representation |
---|---|
bin | 11001001010010000000001… |
… | …00001100101101100110001 |
3 | 21020220021122221111020121211 |
4 | 30211020000201211230301 |
5 | 24222442242020342431 |
6 | 313401121411320121 |
7 | 14440204622155423 |
oct | 1445100041455461 |
9 | 236807587436554 |
10 | 55327777512241 |
11 | 166a1419016a33 |
12 | 6256a888b0041 |
13 | 24b4505404a00 |
14 | d93c432c8813 |
15 | 65e3084a92b1 |
hex | 325200865b31 |
55327777512241 has 24 divisors (see below), whose sum is σ = 60753903552000. Its totient is φ = 50355174909312.
The previous prime is 55327777512191. The next prime is 55327777512247. The reversal of 55327777512241 is 14221577772355.
It is a happy number.
It is not a de Polignac number, because 55327777512241 - 215 = 55327777479473 is a prime.
It is a super-2 number, since 2×553277775122412 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55327777512247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6717525 + ... + 12481213.
It is an arithmetic number, because the mean of its divisors is an integer number (2531412648000).
Almost surely, 255327777512241 is an apocalyptic number.
It is an amenable number.
55327777512241 is a deficient number, since it is larger than the sum of its proper divisors (5426126039759).
55327777512241 is a wasteful number, since it uses less digits than its factorization.
55327777512241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5764513 (or 5764500 counting only the distinct ones).
The product of its digits is 28812000, while the sum is 58.
The spelling of 55327777512241 in words is "fifty-five trillion, three hundred twenty-seven billion, seven hundred seventy-seven million, five hundred twelve thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •