Search a number
-
+
1151015251 is a prime number
BaseRepresentation
bin100010010011011…
…0001100101010011
32222012211122002111
41010212301211103
54324124442001
6310114130151
740344316411
oct10446614523
92865748074
101151015251
11540799881
12281580957
13154603219
14acc1c2b1
156b0b1851
hex449b1953

1151015251 has 2 divisors, whose sum is σ = 1151015252. Its totient is φ = 1151015250.

The previous prime is 1151015233. The next prime is 1151015273. The reversal of 1151015251 is 1525101511.

It is an a-pointer prime, because the next prime (1151015273) can be obtained adding 1151015251 to its sum of digits (22).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1151015251 - 25 = 1151015219 is a prime.

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

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

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

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

Almost surely, 21151015251 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 250, while the sum is 22.

The square root of 1151015251 is about 33926.6156726544. The cubic root of 1151015251 is about 1047.9977720147.

Adding to 1151015251 its reverse (1525101511), we get a palindrome (2676116762).

The spelling of 1151015251 in words is "one billion, one hundred fifty-one million, fifteen thousand, two hundred fifty-one".