Search a number
-
+
151663726913 is a prime number
BaseRepresentation
bin1000110100111111011…
…1001101000101000001
3112111110201001121010212
42031033313031011001
54441101403230123
6153401240003505
713646240260016
oct2151767150501
9474421047125
10151663726913
1159358246876
1225487a60595
13113c016865a
1474aa71370d
153e29bba878
hex234fdcd141

151663726913 has 2 divisors, whose sum is σ = 151663726914. Its totient is φ = 151663726912.

The previous prime is 151663726889. The next prime is 151663726927. The reversal of 151663726913 is 319627366151.

151663726913 is digitally balanced in base 2, 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., 104214689329 + 47449037584 = 322823^2 + 217828^2 .

It is a cyclic number.

It is not a de Polignac number, because 151663726913 - 212 = 151663722817 is a prime.

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

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

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

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

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

Almost surely, 2151663726913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1224720, while the sum is 50.

The spelling of 151663726913 in words is "one hundred fifty-one billion, six hundred sixty-three million, seven hundred twenty-six thousand, nine hundred thirteen".