Search a number
-
+
151915057601 is a prime number
BaseRepresentation
bin1000110101111011010…
…1111101000111000001
3112112010012222112000212
42031132311331013001
54442110223320401
6153442214523505
713655411453366
oct2153665750701
9475105875025
10151915057601
11594770a928a
1225538066595
1311430255938
1474d1c5846d
153e41cb3dbb
hex235ed7d1c1

151915057601 has 2 divisors, whose sum is σ = 151915057602. Its totient is φ = 151915057600.

The previous prime is 151915057571. The next prime is 151915057607. The reversal of 151915057601 is 106750519151.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 125653234576 + 26261823025 = 354476^2 + 162055^2 .

It is a cyclic number.

It is not a de Polignac number, because 151915057601 - 210 = 151915056577 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 2151915057601 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 47250, while the sum is 41.

It can be divided in two parts, 1519150 and 57601, that added together give a palindrome (1576751).

The spelling of 151915057601 in words is "one hundred fifty-one billion, nine hundred fifteen million, fifty-seven thousand, six hundred one".