Search a number
-
+
151027069 is a prime number
BaseRepresentation
bin10010000000001…
…11110101111101
3101112011222012011
421000013311331
5302130331234
622553011221
73512465104
oct1100076575
9345158164
10151027069
1178283966
12426b3b11
132539b53b
14160b503b
15d3d3b64
hex9007d7d

151027069 has 2 divisors, whose sum is σ = 151027070. Its totient is φ = 151027068.

The previous prime is 151027061. The next prime is 151027147. The reversal of 151027069 is 960720151.

151027069 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., 133679844 + 17347225 = 11562^2 + 4165^2 .

It is a cyclic number.

It is not a de Polignac number, because 151027069 - 23 = 151027061 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2151027069 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 151027069 is about 12289.3071000769. The cubic root of 151027069 is about 532.5392202225.

The spelling of 151027069 in words is "one hundred fifty-one million, twenty-seven thousand, sixty-nine".