Search a number
-
+
15100515661061 is a prime number
BaseRepresentation
bin1101101110111101110011…
…0111110011010100000101
31222110121001220022000111002
43123233130313303110011
53434401324002123221
652041025305023045
73115655566210115
oct333573467632405
958417056260432
1015100515661061
1148a210246a446
12183a6b8184a85
13856c848087bc
143a2c24207045
151b2bebcac80b
hexdbbdcdf3505

15100515661061 has 2 divisors, whose sum is σ = 15100515661062. Its totient is φ = 15100515661060.

The previous prime is 15100515661031. The next prime is 15100515661067. The reversal of 15100515661061 is 16016651500151.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 14365199121025 + 735316540036 = 3790145^2 + 857506^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-15100515661061 is a prime.

It is a congruent number.

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

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

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

Almost surely, 215100515661061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27000, while the sum is 38.

The spelling of 15100515661061 in words is "fifteen trillion, one hundred billion, five hundred fifteen million, six hundred sixty-one thousand, sixty-one".