Search a number
-
+
1010012206913 is a prime number
BaseRepresentation
bin11101011001010010110…
…10110011011101000001
310120120000111011020100022
432230221122303131001
5113022001111110123
62051554310503225
7132654021051443
oct16545132633501
93516014136308
101010012206913
1135a386618166
121438b7064b15
137432266b228
1436c56066493
151b4157361c8
hexeb296b3741

1010012206913 has 2 divisors, whose sum is σ = 1010012206914. Its totient is φ = 1010012206912.

The previous prime is 1010012206901. The next prime is 1010012206939. The reversal of 1010012206913 is 3196022100101.

It is an a-pointer prime, because the next prime (1010012206939) can be obtained adding 1010012206913 to its sum of digits (26).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1009689357889 + 322849024 = 1004833^2 + 17968^2 .

It is a cyclic number.

It is not a de Polignac number, because 1010012206913 - 28 = 1010012206657 is a prime.

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

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

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

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

Almost surely, 21010012206913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 648, while the sum is 26.

The spelling of 1010012206913 in words is "one trillion, ten billion, twelve million, two hundred six thousand, nine hundred thirteen".