Base | Representation |
---|---|
bin | 11001000010010101000110… |
… | …11010011111111101110111 |
3 | 21012221021012200111210202002 |
4 | 30201022203122133331313 |
5 | 24204012413400324030 |
6 | 313032113002005515 |
7 | 14411431616153444 |
oct | 1441124332377567 |
9 | 235837180453662 |
10 | 55055632433015 |
11 | 165a6a65235a15 |
12 | 6212197aa689b |
13 | 2494954428956 |
14 | d849c776c9cb |
15 | 6571cb455245 |
hex | 3212a369ff77 |
55055632433015 has 8 divisors (see below), whose sum is σ = 67472434641600. Its totient is φ = 43107388798432.
The previous prime is 55055632432993. The next prime is 55055632433017. The reversal of 55055632433015 is 51033423655055.
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 55055632433015 - 242 = 50657585921911 is a prime.
It is a super-2 number, since 2×550556324330152 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55055632433017) 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, 117139643240 + ... + 117139643709.
It is an arithmetic number, because the mean of its divisors is an integer number (8434054330200).
Almost surely, 255055632433015 is an apocalyptic number.
55055632433015 is a deficient number, since it is larger than the sum of its proper divisors (12416802208585).
55055632433015 is a wasteful number, since it uses less digits than its factorization.
55055632433015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234279287001.
The product of its (nonzero) digits is 4050000, while the sum is 47.
The spelling of 55055632433015 in words is "fifty-five trillion, fifty-five billion, six hundred thirty-two million, four hundred thirty-three thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •