Search a number
-
+
103022503253 is a prime number
BaseRepresentation
bin101111111110010011…
…1101010010101010101
3100211220211000102020122
41133330213222111111
53141442230101003
6115154453441325
710304664554225
oct1377447522525
9324824012218
10103022503253
113a76757657a
1217b72040245
13993aa728c7
144db4644085
152a2e776238
hex17fc9ea555

103022503253 has 2 divisors, whose sum is σ = 103022503254. Its totient is φ = 103022503252.

The previous prime is 103022503217. The next prime is 103022503291. The reversal of 103022503253 is 352305220301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 100966969009 + 2055534244 = 317753^2 + 45338^2 .

It is a cyclic number.

It is not a de Polignac number, because 103022503253 - 26 = 103022503189 is a prime.

It is a super-3 number, since 3×1030225032533 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a congruent number.

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

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

Almost surely, 2103022503253 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5400, while the sum is 26.

Adding to 103022503253 its reverse (352305220301), we get a palindrome (455327723554).

The spelling of 103022503253 in words is "one hundred three billion, twenty-two million, five hundred three thousand, two hundred fifty-three".