Search a number
-
+
1015845514231 is a prime number
BaseRepresentation
bin11101100100001010001…
…11000110101111110111
310121010002000112221122111
432302011013012233313
5113120422422423411
62054401210511451
7133251412254352
oct16620507065767
93533060487574
101015845514231
113618aa3452a9
12144a64735587
1374a42042172
143724aa83299
151b6578e3721
hexec851c6bf7

1015845514231 has 2 divisors, whose sum is σ = 1015845514232. Its totient is φ = 1015845514230.

The previous prime is 1015845514213. The next prime is 1015845514241. The reversal of 1015845514231 is 1324155485101.

It is a happy number.

Together with previous prime (1015845514213) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1015845514231 - 217 = 1015845383159 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 21015845514231 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 96000, while the sum is 40.

The spelling of 1015845514231 in words is "one trillion, fifteen billion, eight hundred forty-five million, five hundred fourteen thousand, two hundred thirty-one".