Base | Representation |
---|---|
bin | 11001000001010101001011… |
… | …11100101100111010101101 |
3 | 21012210222122001121111122020 |
4 | 30200222211330230322231 |
5 | 24202432123143340041 |
6 | 313004235424540353 |
7 | 14406105324500301 |
oct | 1440524574547255 |
9 | 235728561544566 |
10 | 55021315215021 |
11 | 16593455044131 |
12 | 62075bb1816b9 |
13 | 24916457c62bc |
14 | d8308dbd7d01 |
15 | 65636d7e5866 |
hex | 320aa5f2cead |
55021315215021 has 8 divisors (see below), whose sum is σ = 73593178711584. Its totient is φ = 36565164264240.
The previous prime is 55021315215001. The next prime is 55021315215047. The reversal of 55021315215021 is 12051251312055.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 55021315215021 - 223 = 55021306826413 is a prime.
It is a super-4 number, since 4×550213152150214 (a number of 56 digits) contains 4444 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55021315215001) 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, 28928135335 + ... + 28928137236.
It is an arithmetic number, because the mean of its divisors is an integer number (9199147338948).
Almost surely, 255021315215021 is an apocalyptic number.
It is an amenable number.
55021315215021 is a deficient number, since it is larger than the sum of its proper divisors (18571863496563).
55021315215021 is a wasteful number, since it uses less digits than its factorization.
55021315215021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57856272891.
The product of its (nonzero) digits is 15000, while the sum is 33.
Adding to 55021315215021 its reverse (12051251312055), we get a palindrome (67072566527076).
The spelling of 55021315215021 in words is "fifty-five trillion, twenty-one billion, three hundred fifteen million, two hundred fifteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •