Search a number
-
+
151613011639 is a prime number
BaseRepresentation
bin1000110100110011010…
…1101111011010110111
3112111100011121222212101
42031030311233122313
54441000412333024
6153352225002531
713645053223045
oct2151465573267
9474304558771
10151613011639
1159331657721
1225472a83447
13113b27bc80b
1474a3ab1395
153e254edc44
hex234cd6f6b7

151613011639 has 2 divisors, whose sum is σ = 151613011640. Its totient is φ = 151613011638.

The previous prime is 151613011603. The next prime is 151613011643. The reversal of 151613011639 is 936110316151.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 151613011639 - 211 = 151613009591 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 151613011598 and 151613011607.

It is a congruent number.

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

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

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

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

Almost surely, 2151613011639 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 14580, while the sum is 37.

The spelling of 151613011639 in words is "one hundred fifty-one billion, six hundred thirteen million, eleven thousand, six hundred thirty-nine".