Base | Representation |
---|---|
bin | 110011010001100011… |
… | …010100000111100101 |
3 | 12021002220021011211112 |
4 | 303101203110013211 |
5 | 1400223124200031 |
6 | 41143030114405 |
7 | 3656215232606 |
oct | 632143240745 |
9 | 167086234745 |
10 | 55055303141 |
11 | 21392313133 |
12 | a805aaba05 |
13 | 52651c2767 |
14 | 2943ca9dad |
15 | 16735c262b |
hex | cd18d41e5 |
55055303141 has 8 divisors (see below), whose sum is σ = 58278269280. Its totient is φ = 51920637552.
The previous prime is 55055303123. The next prime is 55055303153. The reversal of 55055303141 is 14130355055.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-55055303141 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 55055303098 and 55055303107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55055333141) 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 7 ways as a sum of consecutive naturals, for example, 22073855 + ... + 22076348.
It is an arithmetic number, because the mean of its divisors is an integer number (7284783660).
Almost surely, 255055303141 is an apocalyptic number.
It is an amenable number.
55055303141 is a deficient number, since it is larger than the sum of its proper divisors (3222966139).
55055303141 is a wasteful number, since it uses less digits than its factorization.
55055303141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44150275.
The product of its (nonzero) digits is 22500, while the sum is 32.
Adding to 55055303141 its reverse (14130355055), we get a palindrome (69185658196).
The spelling of 55055303141 in words is "fifty-five billion, fifty-five million, three hundred three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •