Search a number
-
+
153244453213 is a prime number
BaseRepresentation
bin1000111010111000010…
…1001100100101011101
3112122112212110210222101
42032232011030211131
510002321040000323
6154222144245101
714033353234345
oct2165605144535
9478485423871
10153244453213
1159a99553945
1225849310791
13115b27b3767
1475ba62bd25
153ebd85ddad
hex23ae14c95d

153244453213 has 2 divisors, whose sum is σ = 153244453214. Its totient is φ = 153244453212.

The previous prime is 153244453163. The next prime is 153244453237. The reversal of 153244453213 is 312354442351.

153244453213 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., 150957892089 + 2286561124 = 388533^2 + 47818^2 .

It is a cyclic number.

It is not a de Polignac number, because 153244453213 - 213 = 153244445021 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2153244453213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 172800, while the sum is 37.

Adding to 153244453213 its reverse (312354442351), we get a palindrome (465598895564).

The spelling of 153244453213 in words is "one hundred fifty-three billion, two hundred forty-four million, four hundred fifty-three thousand, two hundred thirteen".