Search a number
-
+
103313032132169 is a prime number
BaseRepresentation
bin10111011111011001110000…
…100101001011011001001001
3111112210121222211202201222202
4113133121300211023121021
5102020140042211212134
61003421203551125545
730522056150465306
oct2737316045133111
9445717884681882
10103313032132169
112aa118a1300a12
12b7069115138b5
1345854b9716a52
141b7253d97c0ad
15be262086ed7e
hex5df67094b649

103313032132169 has 2 divisors, whose sum is σ = 103313032132170. Its totient is φ = 103313032132168.

The previous prime is 103313032132159. The next prime is 103313032132237. The reversal of 103313032132169 is 961231230313301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 90626363564944 + 12686668567225 = 9519788^2 + 3561835^2 .

It is a cyclic number.

It is not a de Polignac number, because 103313032132169 - 212 = 103313032128073 is a prime.

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

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

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

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

Almost surely, 2103313032132169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 52488, while the sum is 38.

The spelling of 103313032132169 in words is "one hundred three trillion, three hundred thirteen billion, thirty-two million, one hundred thirty-two thousand, one hundred sixty-nine".