Search a number
-
+
10001093 is a prime number
BaseRepresentation
bin100110001001…
…101011000101
3200211002220212
4212021223011
510030013333
6554205205
7151002464
oct46115305
920732825
1010001093
115710a73
123423805
1320c220b
1414849db
15d28448
hex989ac5

10001093 has 2 divisors, whose sum is σ = 10001094. Its totient is φ = 10001092.

The previous prime is 10001081. The next prime is 10001107. The reversal of 10001093 is 39010001.

It is an a-pointer prime, because the next prime (10001107) can be obtained adding 10001093 to its sum of digits (14).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7745089 + 2256004 = 2783^2 + 1502^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×100010932 = 200043722389298, which contains 22 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

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

Almost surely, 210001093 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27, while the sum is 14.

The square root of 10001093 is about 3162.4504739205. The cubic root of 10001093 is about 215.4513180409.

Adding to 10001093 its reverse (39010001), we get a palindrome (49011094).

The spelling of 10001093 in words is "ten million, one thousand, ninety-three".