Search a number
-
+
10551015149 is a prime number
BaseRepresentation
bin10011101001110001…
…11011011011101101
31000020022121002210212
421310320323123231
5133102024441044
64502544512205
7522315102053
oct116470733355
930208532725
1010551015149
114524855934
12206561b665
13cc1bc4a3c
147213d81d3
1541b451a9e
hex274e3b6ed

10551015149 has 2 divisors, whose sum is σ = 10551015150. Its totient is φ = 10551015148.

The previous prime is 10551015091. The next prime is 10551015151. The reversal of 10551015149 is 94151015501.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7212255625 + 3338759524 = 84925^2 + 57782^2 .

It is a cyclic number.

It is not a de Polignac number, because 10551015149 - 28 = 10551014893 is a prime.

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

Together with 10551015151, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 210551015149 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4500, while the sum is 32.

The spelling of 10551015149 in words is "ten billion, five hundred fifty-one million, fifteen thousand, one hundred forty-nine".