Search a number
-
+
332010100122313 is a prime number
BaseRepresentation
bin100101101111101100010000…
…0000101000110001011001001
31121112112212002201122120102111
41023133120200011012023021
5322004123141112403223
63134043200121102321
7126634636534251154
oct11337304005061311
91545485081576374
10332010100122313
1196874769040788
12312a19469279a1
131133455874cc62
145bdb535c18c9b
15285b52819e30d
hex12df6201462c9

332010100122313 has 2 divisors, whose sum is σ = 332010100122314. Its totient is φ = 332010100122312.

The previous prime is 332010100122307. The next prime is 332010100122341. The reversal of 332010100122313 is 313221001010233.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 320866540911504 + 11143559210809 = 17912748^2 + 3338197^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-332010100122313 is a prime.

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

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

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

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

Almost surely, 2332010100122313 is an apocalyptic number.

It is an amenable number.

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

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

332010100122313 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 22.

Adding to 332010100122313 its reverse (313221001010233), we get a palindrome (645231101132546).

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