Search a number
-
+
153015169 is a prime number
BaseRepresentation
bin10010001111011…
…01001110000001
3101122220222100111
421013231032001
5303132441134
623103351321
73535415236
oct1107551601
9348828314
10153015169
117941161a
12432b2541
1325916428
141647178d
15d677c64
hex91ed381

153015169 has 2 divisors, whose sum is σ = 153015170. Its totient is φ = 153015168.

The previous prime is 153015167. The next prime is 153015193. The reversal of 153015169 is 961510351.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 149450625 + 3564544 = 12225^2 + 1888^2 .

It is a cyclic number.

It is not a de Polignac number, because 153015169 - 21 = 153015167 is a prime.

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

Together with 153015167, it forms a pair of twin primes.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 153015169.

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

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

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

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

Almost surely, 2153015169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4050, while the sum is 31.

The square root of 153015169 is about 12369.9300321384. The cubic root of 153015169 is about 534.8657991633.

The spelling of 153015169 in words is "one hundred fifty-three million, fifteen thousand, one hundred sixty-nine".