Search a number
-
+
21085827477133 is a prime number
BaseRepresentation
bin1001100101101011011010…
…10000011010111010001101
32202122210012120102111221011
410302311231100122322031
510230432233313232013
6112502410113205221
74304254314213526
oct462655520327215
982583176374834
1021085827477133
11679a4a39a4911
1224466a8b60811
13b9c500ac66b3
1452c7b937d84d
152687564c5c3d
hex132d6d41ae8d

21085827477133 has 2 divisors, whose sum is σ = 21085827477134. Its totient is φ = 21085827477132.

The previous prime is 21085827477097. The next prime is 21085827477179. The reversal of 21085827477133 is 33177472858012.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 20016479144484 + 1069348332649 = 4473978^2 + 1034093^2 .

It is a cyclic number.

It is not a de Polignac number, because 21085827477133 - 29 = 21085827476621 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 221085827477133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15805440, while the sum is 58.

The spelling of 21085827477133 in words is "twenty-one trillion, eighty-five billion, eight hundred twenty-seven million, four hundred seventy-seven thousand, one hundred thirty-three".