Search a number
-
+
1303245150331 is a prime number
BaseRepresentation
bin10010111101101111011…
…101101101100001111011
311121120220101200011121011
4102331233131231201323
5132323021224302311
62434411430254351
7163104426000145
oct22755735554173
94546811604534
101303245150331
11462780a03713
121906b21b73b7
1395b84513b37
1447112567c95
1523d78c91321
hex12f6f76d87b

1303245150331 has 2 divisors, whose sum is σ = 1303245150332. Its totient is φ = 1303245150330.

The previous prime is 1303245150313. The next prime is 1303245150341. The reversal of 1303245150331 is 1330515423031.

It is a happy number.

Together with previous prime (1303245150313) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1303245150331 - 225 = 1303211595899 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 1303245150293 and 1303245150302.

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

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

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

Almost surely, 21303245150331 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 16200, while the sum is 31.

The spelling of 1303245150331 in words is "one trillion, three hundred three billion, two hundred forty-five million, one hundred fifty thousand, three hundred thirty-one".