Search a number
-
+
1101010330313 is a prime number
BaseRepresentation
bin10000000001011001010…
…101000110001011001001
310220020220022011212100222
4100001121111012023021
5121014332121032223
62201444104235425
7142355030251655
oct20013125061311
93806808155328
101101010330313
11394a326a0123
1215947216bb75
137ca951c146a
143b409743a65
151d98e5230c8
hex100595462c9

1101010330313 has 2 divisors, whose sum is σ = 1101010330314. Its totient is φ = 1101010330312.

The previous prime is 1101010330267. The next prime is 1101010330327. The reversal of 1101010330313 is 3130330101011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 981351759424 + 119658570889 = 990632^2 + 345917^2 .

It is a cyclic number.

It is not a de Polignac number, because 1101010330313 - 230 = 1099936588489 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 1101010330291 and 1101010330300.

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

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

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

Almost surely, 21101010330313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 81, while the sum is 17.

Adding to 1101010330313 its reverse (3130330101011), we get a palindrome (4231340431324).

The spelling of 1101010330313 in words is "one trillion, one hundred one billion, ten million, three hundred thirty thousand, three hundred thirteen".