Base | Representation |
---|---|
bin | 110011110010111100… |
… | …000011010110000001 |
3 | 12022112221020212212221 |
4 | 303302330003112001 |
5 | 1402400022424121 |
6 | 41314355451041 |
7 | 4006126256515 |
oct | 636274032601 |
9 | 168487225787 |
10 | 55615436161 |
11 | 2164a51138a |
12 | a9415b6a81 |
13 | 532427020c |
14 | 2998436145 |
15 | 16a7867b41 |
hex | cf2f03581 |
55615436161 has 4 divisors (see below), whose sum is σ = 58542564400. Its totient is φ = 52688307924.
The previous prime is 55615436153. The next prime is 55615436221. The reversal of 55615436161 is 16163451655.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 55615436161 - 23 = 55615436153 is a prime.
It is not an unprimeable number, because it can be changed into a prime (55615436101) 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, 1463564091 + ... + 1463564128.
It is an arithmetic number, because the mean of its divisors is an integer number (14635641100).
Almost surely, 255615436161 is an apocalyptic number.
It is an amenable number.
55615436161 is a deficient number, since it is larger than the sum of its proper divisors (2927128239).
55615436161 is a wasteful number, since it uses less digits than its factorization.
55615436161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2927128238.
The product of its digits is 324000, while the sum is 43.
The spelling of 55615436161 in words is "fifty-five billion, six hundred fifteen million, four hundred thirty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •