Base | Representation |
---|---|
bin | 1101000111111… |
… | …1111110011101 |
3 | 10211120211121010 |
4 | 3101333332131 |
5 | 103043101031 |
6 | 5243525433 |
7 | 1235630016 |
oct | 321777635 |
9 | 124524533 |
10 | 55050141 |
11 | 2908aa93 |
12 | 16529879 |
13 | b535c63 |
14 | 745000d |
15 | 4c76246 |
hex | 347ff9d |
55050141 has 8 divisors (see below), whose sum is σ = 75768064. Its totient is φ = 35516160.
The previous prime is 55050139. The next prime is 55050143. The reversal of 55050141 is 14105055.
It is an interprime number because it is at equal distance from previous prime (55050139) and next prime (55050143).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 55050141 - 21 = 55050139 is a prime.
It is a super-3 number, since 3×550501413 (a number of 24 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55050143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 295876 + ... + 296061.
It is an arithmetic number, because the mean of its divisors is an integer number (9471008).
Almost surely, 255050141 is an apocalyptic number.
It is an amenable number.
55050141 is a deficient number, since it is larger than the sum of its proper divisors (20717923).
55050141 is a wasteful number, since it uses less digits than its factorization.
55050141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 591971.
The product of its (nonzero) digits is 500, while the sum is 21.
The square root of 55050141 is about 7419.5782225137. The cubic root of 55050141 is about 380.4107769384.
Adding to 55050141 its reverse (14105055), we get a palindrome (69155196).
The spelling of 55050141 in words is "fifty-five million, fifty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •