Search a number
-
+
153011037269 is a prime number
BaseRepresentation
bin1000111010000000101…
…0110010010001010101
3112121221121021001111102
42032200022302101111
510001331311143034
6154143045315445
714024520233366
oct2164012622125
9477847231442
10153011037269
1159989818002
12257a3105b85
131157632970c
14759762bb6d
153ea810397e
hex23a02b2455

153011037269 has 2 divisors, whose sum is σ = 153011037270. Its totient is φ = 153011037268.

The previous prime is 153011037247. The next prime is 153011037271. The reversal of 153011037269 is 962730110351.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 126353944369 + 26657092900 = 355463^2 + 163270^2 .

It is an emirp because it is prime and its reverse (962730110351) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 153011037269 - 224 = 152994260053 is a prime.

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

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 2153011037269 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 34020, while the sum is 38.

The spelling of 153011037269 in words is "one hundred fifty-three billion, eleven million, thirty-seven thousand, two hundred sixty-nine".