Search a number
-
+
103075481 is a prime number
BaseRepresentation
bin1100010010011…
…00111010011001
321011221202222102
412021030322121
5202341403411
614121133145
72361061415
oct611147231
9234852872
10103075481
1153202153
122a62a1b5
131847c612
14d991d45
1590b0d3b
hex624ce99

103075481 has 2 divisors, whose sum is σ = 103075482. Its totient is φ = 103075480.

The previous prime is 103075477. The next prime is 103075571. The reversal of 103075481 is 184570301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 102191881 + 883600 = 10109^2 + 940^2 .

It is a cyclic number.

It is not a de Polignac number, because 103075481 - 22 = 103075477 is a prime.

It is a super-2 number, since 2×1030754812 = 21249109566762722, which 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 (103075381) by changing a digit.

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

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

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

Almost surely, 2103075481 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3360, while the sum is 29.

The square root of 103075481 is about 10152.6095660180. The cubic root of 103075481 is about 468.8692919263.

The spelling of 103075481 in words is "one hundred three million, seventy-five thousand, four hundred eighty-one".