Search a number
-
+
103066181 is a prime number
BaseRepresentation
bin1100010010010…
…10101001000101
321011221022012222
412021022221011
5202341104211
614121022125
72361022331
oct611125105
9234838188
10103066181
11531a6169
122a624945
131847830a
14d98c7c1
1590ad1db
hex624aa45

103066181 has 2 divisors, whose sum is σ = 103066182. Its totient is φ = 103066180.

The previous prime is 103066177. The next prime is 103066193. The reversal of 103066181 is 181660301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 103022500 + 43681 = 10150^2 + 209^2 .

It is an emirp because it is prime and its reverse (181660301) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 103066181 - 22 = 103066177 is a prime.

It is a super-2 number, since 2×1030661812 = 21245275331849522, which contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 103066181.

It is a congruent number.

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

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

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

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

Almost surely, 2103066181 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 864, while the sum is 26.

The square root of 103066181 is about 10152.1515453622. The cubic root of 103066181 is about 468.8551902359.

The spelling of 103066181 in words is "one hundred three million, sixty-six thousand, one hundred eighty-one".