Search a number
-
+
103230033134153 is a prime number
BaseRepresentation
bin10111011110001100011101…
…011101001000001001001001
3111112111200202111111210010012
4113132030131131020021021
5102012310101440243103
61003315120022401305
730513060311603252
oct2736143535101111
9445450674453105
10103230033134153
112a98a67a559282
12b6b2809290235
13457a72018b7c3
141b6c5087bbb29
15be03b3e592d8
hex5de31d748249

103230033134153 has 2 divisors, whose sum is σ = 103230033134154. Its totient is φ = 103230033134152.

The previous prime is 103230033134093. The next prime is 103230033134177. The reversal of 103230033134153 is 351431330032301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 70456331705929 + 32773701428224 = 8393827^2 + 5724832^2 .

It is a cyclic number.

It is not a de Polignac number, because 103230033134153 - 28 = 103230033133897 is a prime.

It is not a weakly prime, because it can be changed into another prime (103230033134653) 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, 51615016567076 + 51615016567077.

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

Almost surely, 2103230033134153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 29160, while the sum is 32.

Adding to 103230033134153 its reverse (351431330032301), we get a palindrome (454661363166454).

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