Search a number
-
+
103032232001323 is a prime number
BaseRepresentation
bin10111011011010100001111…
…100101101011111100101011
3111111210210012101210010022121
4113123110033211223330223
5102001040002343020243
61003044204241532111
730462555520656562
oct2733241745537453
9444723171703277
10103032232001323
112a9137a6a13579
12b680406044037
134564b89595481
141b62b02760bd9
15bda188a7b1ed
hex5db50f96bf2b

103032232001323 has 2 divisors, whose sum is σ = 103032232001324. Its totient is φ = 103032232001322.

The previous prime is 103032232001287. The next prime is 103032232001327. The reversal of 103032232001323 is 323100232230301.

It is a strong prime.

It is an emirp because it is prime and its reverse (323100232230301) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 103032232001323 - 217 = 103032231870251 is a prime.

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

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

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

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

Almost surely, 2103032232001323 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3888, while the sum is 25.

Adding to 103032232001323 its reverse (323100232230301), we get a palindrome (426132464231624).

The spelling of 103032232001323 in words is "one hundred three trillion, thirty-two billion, two hundred thirty-two million, one thousand, three hundred twenty-three".