Search a number
-
+
13150946689 is a prime number
BaseRepresentation
bin11000011111101101…
…11000010110000001
31020221111211022101121
430033312320112001
5203413120243224
610012542232241
7643615126306
oct141766702601
936844738347
1013150946689
115639403991
122670285681
13131774277a
148ca81d0ad
1551e81bbe4
hex30fdb8581

13150946689 has 2 divisors, whose sum is σ = 13150946690. Its totient is φ = 13150946688.

The previous prime is 13150946687. The next prime is 13150946707. The reversal of 13150946689 is 98664905131.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9174383089 + 3976563600 = 95783^2 + 63060^2 .

It is a cyclic number.

It is not a de Polignac number, because 13150946689 - 21 = 13150946687 is a prime.

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

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

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

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

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

Almost surely, 213150946689 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1399680, while the sum is 52.

The spelling of 13150946689 in words is "thirteen billion, one hundred fifty million, nine hundred forty-six thousand, six hundred eighty-nine".