Search a number
-
+
320032010302013 is a prime number
BaseRepresentation
bin100100011000100010100001…
…0010010100111001000111101
31112222010202120001102220211002
41020301011002102213020331
5313421401024114131023
63052352401554140045
7124260356361550442
oct11061050222471075
91488122501386732
10320032010302013
1192a768a4664209
122ba88420881625
1310975b733c4159
1459058bc0b99c9
1526eeb78a68b28
hex12311424a723d

320032010302013 has 2 divisors, whose sum is σ = 320032010302014. Its totient is φ = 320032010302012.

The previous prime is 320032010302003. The next prime is 320032010302021. The reversal of 320032010302013 is 310203010230023.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 316207099177369 + 3824911124644 = 17782213^2 + 1955738^2 .

It is a cyclic number.

It is not a de Polignac number, because 320032010302013 - 224 = 320031993524797 is a prime.

It is a super-3 number, since 3×3200320103020133 (a number of 44 digits) contains 333 as substring.

It is a congruent number.

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

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

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

Almost surely, 2320032010302013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 320032010302013 its reverse (310203010230023), we get a palindrome (630235020532036).

The spelling of 320032010302013 in words is "three hundred twenty trillion, thirty-two billion, ten million, three hundred two thousand, thirteen".