Base | Representation |
---|---|
bin | 110011010001100100… |
… | …010000011001101101 |
3 | 12021002220201201112201 |
4 | 303101210100121231 |
5 | 1400223210100221 |
6 | 41143035301501 |
7 | 3656220311521 |
oct | 632144203155 |
9 | 167086651481 |
10 | 55055550061 |
11 | 213924716a6 |
12 | a805baa891 |
13 | 526527ac75 |
14 | 2943d31d81 |
15 | 1673620891 |
hex | cd191066d |
55055550061 has 4 divisors (see below), whose sum is σ = 55958100124. Its totient is φ = 54153000000.
The previous prime is 55055550059. The next prime is 55055550079. The reversal of 55055550061 is 16005555055.
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 8860645161 + 46194904900 = 94131^2 + 214930^2 .
It is a cyclic number.
It is not a de Polignac number, because 55055550061 - 21 = 55055550059 is a prime.
It is a super-2 number, since 2×550555500612 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 55055550061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55055550031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 451274940 + ... + 451275061.
It is an arithmetic number, because the mean of its divisors is an integer number (13989525031).
Almost surely, 255055550061 is an apocalyptic number.
It is an amenable number.
55055550061 is a deficient number, since it is larger than the sum of its proper divisors (902550063).
55055550061 is an equidigital number, since it uses as much as digits as its factorization.
55055550061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 902550062.
The product of its (nonzero) digits is 93750, while the sum is 37.
The spelling of 55055550061 in words is "fifty-five billion, fifty-five million, five hundred fifty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •