Search a number
-
+
10152544049981 is a prime number
BaseRepresentation
bin1001001110111101001011…
…0010000001101100111101
31022221120111020202220012022
42103233102302001230331
52312314402234044411
633332003033245525
72065332335361014
oct223572262015475
938846436686168
1010152544049981
113264740492613
12117b76a5638a5
135884c47bb1a8
14271558719a7b
1512915704eedb
hex93bd2c81b3d

10152544049981 has 2 divisors, whose sum is σ = 10152544049982. Its totient is φ = 10152544049980.

The previous prime is 10152544049849. The next prime is 10152544050037. The reversal of 10152544049981 is 18994044525101.

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., 9340083384025 + 812460665956 = 3056155^2 + 901366^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

Almost surely, 210152544049981 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2073600, while the sum is 53.

The spelling of 10152544049981 in words is "ten trillion, one hundred fifty-two billion, five hundred forty-four million, forty-nine thousand, nine hundred eighty-one".