Search a number
-
+
15710138794621 is a prime number
BaseRepresentation
bin1110010010011100110100…
…1111100000001001111101
32001121212121120202220112101
43210213031033200021331
54024343331012411441
653225045500305101
73211006612305115
oct344471517401175
961555546686471
1015710138794621
1150076a5872687
121918891842191
1389c5c905167b
143c453654c045
151c39cb894231
hexe49cd3e027d

15710138794621 has 2 divisors, whose sum is σ = 15710138794622. Its totient is φ = 15710138794620.

The previous prime is 15710138794601. The next prime is 15710138794703. The reversal of 15710138794621 is 12649783101751.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 13015780692121 + 2694358102500 = 3607739^2 + 1641450^2 .

It is a cyclic number.

It is not a de Polignac number, because 15710138794621 - 215 = 15710138761853 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (15710138794601) 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, 7855069397310 + 7855069397311.

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

It is a 1-persistent number, because it is pandigital, but 2⋅15710138794621 = 31420277589242 is not.

Almost surely, 215710138794621 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2540160, while the sum is 55.

The spelling of 15710138794621 in words is "fifteen trillion, seven hundred ten billion, one hundred thirty-eight million, seven hundred ninety-four thousand, six hundred twenty-one".