Search a number
-
+
13150291026377 is a prime number
BaseRepresentation
bin1011111101011100101001…
…1011001110000111001001
31201120011012101120201021202
42333113022123032013021
53210423244000321002
643545054342513545
72525035320266141
oct277271233160711
951504171521252
1013150291026377
11421000950330a
121584745a358b5
137450b461301b
143366982d1921
1517c108aa1502
hexbf5ca6ce1c9

13150291026377 has 2 divisors, whose sum is σ = 13150291026378. Its totient is φ = 13150291026376.

The previous prime is 13150291026239. The next prime is 13150291026413. The reversal of 13150291026377 is 77362019205131.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7917492950416 + 5232798075961 = 2813804^2 + 2287531^2 .

It is a cyclic number.

It is not a de Polignac number, because 13150291026377 - 216 = 13150290960841 is a prime.

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

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

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

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

Almost surely, 213150291026377 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 476280, while the sum is 47.

The spelling of 13150291026377 in words is "thirteen trillion, one hundred fifty billion, two hundred ninety-one million, twenty-six thousand, three hundred seventy-seven".