Search a number
-
+
56001105049 is a prime number
BaseRepresentation
bin110100001001111011…
…010000110010011001
312100112210221220010211
4310021323100302121
51404142240330144
641420534011121
74021521352561
oct641173206231
9170483856124
1056001105049
11218281890aa
12aa2a7a6aa1
135386134766
1429d3749da1
1516cb64a034
hexd09ed0c99

56001105049 has 2 divisors, whose sum is σ = 56001105050. Its totient is φ = 56001105048.

The previous prime is 56001105037. The next prime is 56001105071. The reversal of 56001105049 is 94050110065.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 55996123225 + 4981824 = 236635^2 + 2232^2 .

It is a cyclic number.

It is not a de Polignac number, because 56001105049 - 27 = 56001104921 is a prime.

It is a super-2 number, since 2×560011050492 (a number of 22 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 56001105049.

It is not a weakly prime, because it can be changed into another prime (56001105079) 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 as a sum of consecutive naturals, namely, 28000552524 + 28000552525.

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

Almost surely, 256001105049 is an apocalyptic number.

It is an amenable number.

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

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

56001105049 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 5400, while the sum is 31.

The spelling of 56001105049 in words is "fifty-six billion, one million, one hundred five thousand, forty-nine".