Search a number
-
+
5999644851181 is a prime number
BaseRepresentation
bin101011101001110011010…
…1100110011101111101101
3210020120010120021010022021
41113103212230303233231
51241244233040214211
620432110534550141
71156313535540652
oct127234654635755
923216116233267
105999644851181
111a03487120933
1280a930b08351
133469c18c3177
1416a554981c29
15a60e7bd3771
hex574e6b33bed

5999644851181 has 2 divisors, whose sum is σ = 5999644851182. Its totient is φ = 5999644851180.

The previous prime is 5999644851143. The next prime is 5999644851229. The reversal of 5999644851181 is 1811584469995.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5469325918281 + 530318932900 = 2338659^2 + 728230^2 .

It is a cyclic number.

It is not a de Polignac number, because 5999644851181 - 29 = 5999644850669 is a prime.

It is a super-2 number, since 2×59996448511812 (a number of 26 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 5999644851181.

It is a congruent number.

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

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

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

Almost surely, 25999644851181 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 111974400, while the sum is 70.

The spelling of 5999644851181 in words is "five trillion, nine hundred ninety-nine billion, six hundred forty-four million, eight hundred fifty-one thousand, one hundred eighty-one".