Search a number
-
+
1015857368489 is a prime number
BaseRepresentation
bin11101100100001011101…
…00010100110110101001
310121010002211212012122002
432302011310110312221
5113120433441242424
62054402312540345
7133251615106025
oct16620564246651
93533084765562
101015857368489
11361906001607
12144a686b16b5
1374a44632a12
143724c48b385
151b658985cae
hexec85d14da9

1015857368489 has 2 divisors, whose sum is σ = 1015857368490. Its totient is φ = 1015857368488.

The previous prime is 1015857368429. The next prime is 1015857368507. The reversal of 1015857368489 is 9848637585101.

1015857368489 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 638707852864 + 377149515625 = 799192^2 + 614125^2 .

It is a cyclic number.

It is not a de Polignac number, because 1015857368489 - 216 = 1015857302953 is a prime.

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

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

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

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

Almost surely, 21015857368489 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 58060800, while the sum is 65.

The spelling of 1015857368489 in words is "one trillion, fifteen billion, eight hundred fifty-seven million, three hundred sixty-eight thousand, four hundred eighty-nine".