Search a number
-
+
159269147 is a prime number
BaseRepresentation
bin10010111111001…
…00000100011011
3102002200201012022
421133210010123
5311233103042
623445405055
73642523352
oct1137440433
9362621168
10159269147
11819a32a4
124540978b
1326cc5bcb
141721c999
15deb0cd2
hex97e411b

159269147 has 2 divisors, whose sum is σ = 159269148. Its totient is φ = 159269146.

The previous prime is 159269129. The next prime is 159269161. The reversal of 159269147 is 741962951.

159269147 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 is a cyclic number.

It is not a de Polignac number, because 159269147 - 26 = 159269083 is a prime.

It is a super-2 number, since 2×1592691472 = 50733322372215218, which contains 22 as substring.

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

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

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

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

Almost surely, 2159269147 is an apocalyptic number.

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

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

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

The product of its digits is 136080, while the sum is 44.

The square root of 159269147 is about 12620.1880730835. The cubic root of 159269147 is about 542.0556614177.

The spelling of 159269147 in words is "one hundred fifty-nine million, two hundred sixty-nine thousand, one hundred forty-seven".