Search a number
-
+
10214246111569 is a prime number
BaseRepresentation
bin1001010010100011000010…
…0000101101100101010001
31100011110202101002101111121
42110220300200231211101
52314322234001032234
633420205422442241
72102645353265263
oct224506040554521
940143671071447
1010214246111569
113288923710745
12118b70a433381
13591278a670c6
1427452d26db33
1512aa68e124b4
hex94a3082d951

10214246111569 has 2 divisors, whose sum is σ = 10214246111570. Its totient is φ = 10214246111568.

The previous prime is 10214246111551. The next prime is 10214246111687. The reversal of 10214246111569 is 96511164241201.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 8220050245969 + 1994195865600 = 2867063^2 + 1412160^2 .

It is a cyclic number.

It is not a de Polignac number, because 10214246111569 - 223 = 10214237722961 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (10214246111539) 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, 5107123055784 + 5107123055785.

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

Almost surely, 210214246111569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 103680, while the sum is 43.

The spelling of 10214246111569 in words is "ten trillion, two hundred fourteen billion, two hundred forty-six million, one hundred eleven thousand, five hundred sixty-nine".