Search a number
-
+
10132022011313 is a prime number
BaseRepresentation
bin1001001101110000101110…
…0100101010010110110001
31022212121112000221022112002
42103130023210222112301
52312000340113330223
633314330414543345
72064004644050336
oct223341344522661
938777460838462
1010132022011313
113256a6a314184
1211777a1807b55
135865a3c13147
1427056cd8298d
15128855565e28
hex9370b92a5b1

10132022011313 has 2 divisors, whose sum is σ = 10132022011314. Its totient is φ = 10132022011312.

The previous prime is 10132022011301. The next prime is 10132022011327. The reversal of 10132022011313 is 31311022023101.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5818790855089 + 4313231156224 = 2412217^2 + 2076832^2 .

It is a cyclic number.

It is not a de Polignac number, because 10132022011313 - 220 = 10132020962737 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 210132022011313 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 10132022011313 its reverse (31311022023101), we get a palindrome (41443044034414).

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