Search a number
-
+
5949134678881 is a prime number
BaseRepresentation
bin101011010010010010000…
…0011110010101101100001
3210001201202102110111212001
41112210210003302231201
51234432311434211011
620352554510404001
71152545050263262
oct126444403625541
923051672414761
105949134678881
111994017483889
12800b95200601
13342002249254
14167d225ac969
15a4b3d6667c1
hex569240f2b61

5949134678881 has 2 divisors, whose sum is σ = 5949134678882. Its totient is φ = 5949134678880.

The previous prime is 5949134678867. The next prime is 5949134678947. The reversal of 5949134678881 is 1888764319495.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5033651216400 + 915483462481 = 2243580^2 + 956809^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-5949134678881 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 25949134678881 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 418037760, while the sum is 73.

The spelling of 5949134678881 in words is "five trillion, nine hundred forty-nine billion, one hundred thirty-four million, six hundred seventy-eight thousand, eight hundred eighty-one".