Search a number
-
+
151515151515151 is a prime number
BaseRepresentation
bin100010011100110101011110…
…110010001011111000001111
3201212110201002102100122112221
4202130311132302023320033
5124324411012241441101
61254125033311240211
743625415462141454
oct4234653662137017
9655421072318487
10151515151515151
11443062400471a6
1214bb0799819067
136670a8200aca8
14295b53006b82b
15127b3cba6baa1
hex89cd5ec8be0f

151515151515151 has 2 divisors, whose sum is σ = 151515151515152. Its totient is φ = 151515151515150.

The previous prime is 151515151515137. The next prime is 151515151515209.

151515151515151 is nontrivially palindromic in base 10.

It is a weak prime.

It is a palprime.

It is a cyclic number.

It is not a de Polignac number, because 151515151515151 - 225 = 151515117960719 is a prime.

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

151515151515151 is an undulating number in base 10.

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

It is a congruent number.

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

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

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

Almost surely, 2151515151515151 is an apocalyptic number.

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

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

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

The product of its digits is 78125, while the sum is 43.

The spelling of 151515151515151 in words is "one hundred fifty-one trillion, five hundred fifteen billion, one hundred fifty-one million, five hundred fifteen thousand, one hundred fifty-one".