Base | Representation |
---|---|
bin | 11001000111001111111101… |
… | …01000110101011101010000 |
3 | 21020112102111222012100000021 |
4 | 30203213332220311131100 |
5 | 24214300104130023011 |
6 | 313241510035433224 |
7 | 14426564502220216 |
oct | 1443477650653520 |
9 | 236472458170007 |
10 | 55224666642256 |
11 | 16661716685201 |
12 | 623aab1155814 |
13 | 24a78822626c7 |
14 | d8cc61040cb6 |
15 | 65b7c10ca471 |
hex | 3239fea35750 |
55224666642256 has 20 divisors (see below), whose sum is σ = 112629254336800. Its totient is φ = 26159052619872.
The previous prime is 55224666642251. The next prime is 55224666642269. The reversal of 55224666642256 is 65224666642255.
It is a junction number, because it is equal to n+sod(n) for n = 55224666642194 and 55224666642203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55224666642251) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 90830043516 + ... + 90830044123.
It is an arithmetic number, because the mean of its divisors is an integer number (5631462716840).
Almost surely, 255224666642256 is an apocalyptic number.
It is an amenable number.
55224666642256 is an abundant number, since it is smaller than the sum of its proper divisors (57404587694544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55224666642256 is a wasteful number, since it uses less digits than its factorization.
55224666642256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181660087666 (or 181660087660 counting only the distinct ones).
The product of its digits is 248832000, while the sum is 61.
Subtracting 55224666642256 from its reverse (65224666642255), we obtain a palindrome (9999999999999).
The spelling of 55224666642256 in words is "fifty-five trillion, two hundred twenty-four billion, six hundred sixty-six million, six hundred forty-two thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •