Search a number
-
+
13150957 is a prime number
BaseRepresentation
bin110010001010…
…101011101101
3220202010201111
4302022223231
511331312312
61145512021
7216531661
oct62125355
926663644
1013150957
117472566
1244a2611
132955b41
141a648a1
15124b8a7
hexc8aaed

13150957 has 2 divisors, whose sum is σ = 13150958. Its totient is φ = 13150956.

The previous prime is 13150933. The next prime is 13150967. The reversal of 13150957 is 75905131.

13150957 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11249316 + 1901641 = 3354^2 + 1379^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 13150957 - 27 = 13150829 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 213150957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4725, while the sum is 31.

The square root of 13150957 is about 3626.4248234315. The cubic root of 13150957 is about 236.0400978023.

The spelling of 13150957 in words is "thirteen million, one hundred fifty thousand, nine hundred fifty-seven".