Search a number
-
+
10151555131 is a prime number
BaseRepresentation
bin10010111010001010…
…00111000000111011
3222012110221102200101
421131011013000323
5131242244231011
64355155020231
7506364536434
oct113505070073
928173842611
1010151555131
11433a319693
121b7389a677
13c5a212173
146c433448b
153e63482c1
hex25d14703b

10151555131 has 2 divisors, whose sum is σ = 10151555132. Its totient is φ = 10151555130.

The previous prime is 10151555101. The next prime is 10151555143. The reversal of 10151555131 is 13155515101.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10151555131 - 27 = 10151555003 is a prime.

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

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

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

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

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

Almost surely, 210151555131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1875, while the sum is 28.

The spelling of 10151555131 in words is "ten billion, one hundred fifty-one million, five hundred fifty-five thousand, one hundred thirty-one".