Search a number
-
+
10531612151 is a prime number
BaseRepresentation
bin10011100111011101…
…11010010111110111
31000011222002022220022
421303232322113313
5133032043042101
64501012555355
7521661140414
oct116356722767
930158068808
1010531612151
1145149030a5
12205b022b5b
13cbab90288
1471c9c710b
154198bca1b
hex273bba5f7

10531612151 has 2 divisors, whose sum is σ = 10531612152. Its totient is φ = 10531612150.

The previous prime is 10531612141. The next prime is 10531612181. The reversal of 10531612151 is 15121613501.

It is a weak prime.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10531612151 is a prime.

It is a super-2 number, since 2×105316121512 (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 10531612151.

It is a congruent number.

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

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

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

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

Almost surely, 210531612151 is an apocalyptic number.

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

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

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

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

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