Search a number
-
+
103301013201313 is a prime number
BaseRepresentation
bin10111011111001110100100…
…001100100110000110100001
3111112202110222020000210101111
4113133032210030212012201
5102014440433334420223
61003411455203503321
730521152256324464
oct2737164414460641
9445673866023344
10103301013201313
112aa0779399a304
12b704518387b41
134584322684645
141b71b1d6332db
15be216a61030d
hex5df3a43261a1

103301013201313 has 2 divisors, whose sum is σ = 103301013201314. Its totient is φ = 103301013201312.

The previous prime is 103301013201283. The next prime is 103301013201317. The reversal of 103301013201313 is 313102310103301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 102215901395344 + 1085111805969 = 10110188^2 + 1041687^2 .

It is a cyclic number.

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

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2103301013201313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 22.

Adding to 103301013201313 its reverse (313102310103301), we get a palindrome (416403323304614).

The spelling of 103301013201313 in words is "one hundred three trillion, three hundred one billion, thirteen million, two hundred one thousand, three hundred thirteen".