Search a number
-
+
15027455231 is a prime number
BaseRepresentation
bin11011111111011010…
…01100010011111111
31102210021210211011222
431333231030103333
5221234012031411
610523054303555
71041252155555
oct157755142377
942707724158
1015027455231
116411674598
122ab47b7bbb
13155643c959
14a27b2dbd5
155ce4394db
hex37fb4c4ff

15027455231 has 2 divisors, whose sum is σ = 15027455232. Its totient is φ = 15027455230.

The previous prime is 15027455227. The next prime is 15027455263. The reversal of 15027455231 is 13255472051.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 15027455231 - 22 = 15027455227 is a prime.

It is a super-3 number, since 3×150274552313 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

It is a congruent number.

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

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

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

Almost surely, 215027455231 is an apocalyptic number.

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

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

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

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

The spelling of 15027455231 in words is "fifteen billion, twenty-seven million, four hundred fifty-five thousand, two hundred thirty-one".