Search a number
-
+
56099915161 is a prime number
BaseRepresentation
bin110100001111110100…
…001100010110011001
312100210200212222010121
4310033310030112121
51404343034241121
641434423513241
74024131260653
oct641764142631
9170720788117
1056099915161
1121878a37654
12aa578b8821
1353a074c794
142a0290b6d3
1516d5167141
hexd0fd0c599

56099915161 has 2 divisors, whose sum is σ = 56099915162. Its totient is φ = 56099915160.

The previous prime is 56099915159. The next prime is 56099915191. The reversal of 56099915161 is 16151999065.

It is a happy number.

56099915161 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 52874243136 + 3225672025 = 229944^2 + 56795^2 .

It is a cyclic number.

It is not a de Polignac number, because 56099915161 - 21 = 56099915159 is a prime.

Together with 56099915159, it forms a pair of twin primes.

It is a junction number, because it is equal to n+sod(n) for n = 56099915099 and 56099915108.

It is not a weakly prime, because it can be changed into another prime (56099915101) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28049957580 + 28049957581.

It is an arithmetic number, because the mean of its divisors is an integer number (28049957581).

Almost surely, 256099915161 is an apocalyptic number.

It is an amenable number.

56099915161 is a deficient number, since it is larger than the sum of its proper divisors (1).

56099915161 is an equidigital number, since it uses as much as digits as its factorization.

56099915161 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 656100, while the sum is 52.

The spelling of 56099915161 in words is "fifty-six billion, ninety-nine million, nine hundred fifteen thousand, one hundred sixty-one".