Search a number
-
+
10566093193 is a prime number
BaseRepresentation
bin10011101011100100…
…11100100110001001
31000021100222010222221
421311302130212021
5133114404440233
64504244014041
7522560211265
oct116562344611
930240863887
1010566093193
114532314227
12206a691321
13cc5073a66
147234010a5
1541c92e42d
hex275c9c989

10566093193 has 2 divisors, whose sum is σ = 10566093194. Its totient is φ = 10566093192.

The previous prime is 10566093191. The next prime is 10566093199. The reversal of 10566093193 is 39139066501.

10566093193 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10420938889 + 145154304 = 102083^2 + 12048^2 .

It is a cyclic number.

It is not a de Polignac number, because 10566093193 - 21 = 10566093191 is a prime.

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

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

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

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

Almost surely, 210566093193 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 10566093193 in words is "ten billion, five hundred sixty-six million, ninety-three thousand, one hundred ninety-three".