Search a number
-
+
1110933891281 is a prime number
BaseRepresentation
bin10000001010101000110…
…100011110100011010001
310221012111220002222212002
4100022220310132203101
5121200143034010111
62210204520443345
7143155656161414
oct20125064364321
93835456088762
101110933891281
11399165246385
1215b381619555
13809b70c7326
143baab689b7b
151dd7083263b
hex102a8d1e8d1

1110933891281 has 2 divisors, whose sum is σ = 1110933891282. Its totient is φ = 1110933891280.

The previous prime is 1110933891269. The next prime is 1110933891283. The reversal of 1110933891281 is 1821983390111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1086214190656 + 24719700625 = 1042216^2 + 157225^2 .

It is a cyclic number.

It is not a de Polignac number, because 1110933891281 - 222 = 1110929696977 is a prime.

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

Together with 1110933891283, it forms a pair of twin primes.

It is a Chen prime.

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

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

Almost surely, 21110933891281 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 93312, while the sum is 47.

The spelling of 1110933891281 in words is "one trillion, one hundred ten billion, nine hundred thirty-three million, eight hundred ninety-one thousand, two hundred eighty-one".