Search a number
-
+
2023303013 is a prime number
BaseRepresentation
bin111100010011001…
…0010011101100101
312020000012102221122
41320212102131211
513120431144023
6532434223325
7101065535414
oct17046223545
95200172848
102023303013
11949113556
12485724b45
13263246024
14152a0347b
15bc9672c8
hex78992765

2023303013 has 2 divisors, whose sum is σ = 2023303014. Its totient is φ = 2023303012.

The previous prime is 2023302971. The next prime is 2023303067. The reversal of 2023303013 is 3103033202.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1681164004 + 342139009 = 41002^2 + 18497^2 .

It is a cyclic number.

It is not a de Polignac number, because 2023303013 - 218 = 2023040869 is a prime.

It is a super-4 number, since 4×20233030134 (a number of 38 digits) contains 4444 as substring.

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 = 2023302982 and 2023303000.

It is a congruent number.

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

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

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

Almost surely, 22023303013 is an apocalyptic number.

It is an amenable number.

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

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

2023303013 is an evil number, because the sum of its binary digits is even.

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

The square root of 2023303013 is about 44981.1406369381. The cubic root of 2023303013 is about 1264.7954931942.

Adding to 2023303013 its reverse (3103033202), we get a palindrome (5126336215).

The spelling of 2023303013 in words is "two billion, twenty-three million, three hundred three thousand, thirteen".