Base | Representation |
---|---|
bin | 110011010001001111… |
… | …010100000100011101 |
3 | 12021002112101210200101 |
4 | 303101033110010131 |
5 | 1400220303410221 |
6 | 41142321501101 |
7 | 3656122534633 |
oct | 632117240435 |
9 | 167075353611 |
10 | 55050060061 |
11 | 2138a361a07 |
12 | a8041a1791 |
13 | 52640a8149 |
14 | 2943303353 |
15 | 1672dd8d91 |
hex | cd13d411d |
55050060061 has 4 divisors (see below), whose sum is σ = 55952520124. Its totient is φ = 54147600000.
The previous prime is 55050060041. The next prime is 55050060119. The reversal of 55050060061 is 16006005055.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 22840579161 + 32209480900 = 151131^2 + 179470^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-55050060061 is a prime.
It is a super-2 number, since 2×550500600612 (a number of 22 digits) contains 22 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 (55050060011) 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 3 ways as a sum of consecutive naturals, for example, 451229940 + ... + 451230061.
It is an arithmetic number, because the mean of its divisors is an integer number (13988130031).
Almost surely, 255050060061 is an apocalyptic number.
It is an amenable number.
55050060061 is a deficient number, since it is larger than the sum of its proper divisors (902460063).
55050060061 is an equidigital number, since it uses as much as digits as its factorization.
55050060061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 902460062.
The product of its (nonzero) digits is 4500, while the sum is 28.
The spelling of 55050060061 in words is "fifty-five billion, fifty million, sixty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •