Search a number
-
+
151641137213 is a prime number
BaseRepresentation
bin1000110100111010000…
…1000010000000111101
3112111102010112220220022
42031032201002000331
54441030112342323
6153355111501525
713645544253566
oct2151641020075
9474363486808
10151641137213
11593465178a5
12254803878a5
13113b8589577
1474a771316d
153e27c074c8
hex234e84203d

151641137213 has 2 divisors, whose sum is σ = 151641137214. Its totient is φ = 151641137212.

The previous prime is 151641137209. The next prime is 151641137231. The reversal of 151641137213 is 312731146151.

Together with next prime (151641137231) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 133227190009 + 18413947204 = 365003^2 + 135698^2 .

It is a cyclic number.

It is not a de Polignac number, because 151641137213 - 22 = 151641137209 is a prime.

It is a super-3 number, since 3×1516411372133 (a number of 35 digits) contains 333 as substring.

It is a congruent number.

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

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

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

Almost surely, 2151641137213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 15120, while the sum is 35.

The spelling of 151641137213 in words is "one hundred fifty-one billion, six hundred forty-one million, one hundred thirty-seven thousand, two hundred thirteen".