Search a number
-
+
151727652269 is a prime number
BaseRepresentation
bin1000110101001110101…
…1000011110110101101
3112111122011100100020122
42031103223003312231
54441214234333034
6153411442054325
713650644523224
oct2152353036655
9474564310218
10151727652269
1159390338946
12254a534a3a5
131140048b1cb
1474b4dd3cbb
153e305e662e
hex2353ac3dad

151727652269 has 2 divisors, whose sum is σ = 151727652270. Its totient is φ = 151727652268.

The previous prime is 151727652253. The next prime is 151727652299. The reversal of 151727652269 is 962256727151.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 149488943044 + 2238709225 = 386638^2 + 47315^2 .

It is a cyclic number.

It is not a de Polignac number, because 151727652269 - 24 = 151727652253 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2151727652269 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 3175200, while the sum is 53.

The spelling of 151727652269 in words is "one hundred fifty-one billion, seven hundred twenty-seven million, six hundred fifty-two thousand, two hundred sixty-nine".