Search a number
-
+
151400503901 is a prime number
BaseRepresentation
bin1000110100000000101…
…1000101101001011101
3112110210100202111001102
42031000023011221131
54440032012111101
6153315154122445
713636563023003
oct2150013055135
9473710674042
10151400503901
1159232701499
1225413880425
131137a7763aa
147483794a73
153e11a2386b
hex23402c5a5d

151400503901 has 2 divisors, whose sum is σ = 151400503902. Its totient is φ = 151400503900.

The previous prime is 151400503843. The next prime is 151400504029. The reversal of 151400503901 is 109305004151.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 125527781401 + 25872722500 = 354299^2 + 160850^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-151400503901 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2151400503901 is an apocalyptic number.

It is an amenable number.

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

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

151400503901 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 2700, while the sum is 29.

The spelling of 151400503901 in words is "one hundred fifty-one billion, four hundred million, five hundred three thousand, nine hundred one".