Search a number
-
+
154069037 is a prime number
BaseRepresentation
bin10010010111011…
…10100000101101
3101201220111222122
421023232200231
5303420202122
623142122325
73550364603
oct1113564055
9351814878
10154069037
1179a71391
12437203a5
1325bc5015
1416667873
15d7d5142
hex92ee82d

154069037 has 2 divisors, whose sum is σ = 154069038. Its totient is φ = 154069036.

The previous prime is 154069031. The next prime is 154069049. The reversal of 154069037 is 730960451.

154069037 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 103103716 + 50965321 = 10154^2 + 7139^2 .

It is a cyclic number.

It is not a de Polignac number, because 154069037 - 218 = 153806893 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2154069037 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 22680, while the sum is 35.

The square root of 154069037 is about 12412.4549143189. The cubic root of 154069037 is about 536.0909256251.

The spelling of 154069037 in words is "one hundred fifty-four million, sixty-nine thousand, thirty-seven".