Base | Representation |
---|---|
bin | 11001001010000101011101… |
… | …10111011011110101100001 |
3 | 21020212202001010211211122011 |
4 | 30211002232313123311201 |
5 | 24222344141302240001 |
6 | 313354343323312521 |
7 | 14436614343535366 |
oct | 1445025667336541 |
9 | 236782033754564 |
10 | 55322112540001 |
11 | 16699a8131449a |
12 | 625596767b741 |
13 | 24b3b1187c328 |
14 | d93866baa46d |
15 | 65e0c5e9dd51 |
hex | 3250aeddbd61 |
55322112540001 has 8 divisors (see below), whose sum is σ = 55404264643200. Its totient is φ = 55239974907600.
The previous prime is 55322112539971. The next prime is 55322112540017. The reversal of 55322112540001 is 10004521122355.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 55322112540001 - 211 = 55322112537953 is a prime.
It is a super-2 number, since 2×553221125400012 (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 (55322112580001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4046055 + ... + 11270083.
It is an arithmetic number, because the mean of its divisors is an integer number (6925533080400).
Almost surely, 255322112540001 is an apocalyptic number.
It is an amenable number.
55322112540001 is a deficient number, since it is larger than the sum of its proper divisors (82152103199).
55322112540001 is a wasteful number, since it uses less digits than its factorization.
55322112540001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7235399.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 55322112540001 its reverse (10004521122355), we get a palindrome (65326633662356).
The spelling of 55322112540001 in words is "fifty-five trillion, three hundred twenty-two billion, one hundred twelve million, five hundred forty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •