Search a number
-
+
103010233013 is a prime number
BaseRepresentation
bin101111111101111100…
…0110110101010110101
3100211212221221000122022
41133323320312222311
53141431104424023
6115153334442525
710304455351022
oct1377370665265
9324787830568
10103010233013
113a760655786
1217b69b03445
1399383678cc
144db2b6c549
152a2d6507c8
hex17fbe36ab5

103010233013 has 2 divisors, whose sum is σ = 103010233014. Its totient is φ = 103010233012.

The previous prime is 103010233003. The next prime is 103010233037. The reversal of 103010233013 is 310332010301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 97545031684 + 5465201329 = 312322^2 + 73927^2 .

It is a cyclic number.

It is not a de Polignac number, because 103010233013 - 28 = 103010232757 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2103010233013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 103010233013 its reverse (310332010301), we get a palindrome (413342243314).

The spelling of 103010233013 in words is "one hundred three billion, ten million, two hundred thirty-three thousand, thirteen".