Search a number
-
+
103015151 is a prime number
BaseRepresentation
bin1100010001111…
…10001011101111
321011211201012222
412020332023233
5202332441101
614115545555
72360420501
oct610761357
9234751188
10103015151
1153170898
122a5bb2bb
131845b015
14d977d71
15909d01b
hex623e2ef

103015151 has 2 divisors, whose sum is σ = 103015152. Its totient is φ = 103015150.

The previous prime is 103015147. The next prime is 103015193. The reversal of 103015151 is 151510301.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 103015151 - 22 = 103015147 is a prime.

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

It is a Sophie Germain prime.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 2103015151 is an apocalyptic number.

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

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

103015151 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 75, while the sum is 17.

The square root of 103015151 is about 10149.6379738393. The cubic root of 103015151 is about 468.7777977945. Note that the first 4 decimals are identical.

Adding to 103015151 its reverse (151510301), we get a palindrome (254525452).

It can be divided in two parts, 10301 and 5151, that multiplied together give a triangular number (53060451 = T10301).

The spelling of 103015151 in words is "one hundred three million, fifteen thousand, one hundred fifty-one".