Search a number
-
+
103005352152203 is a prime number
BaseRepresentation
bin10111011010111011001101…
…011011001100110010001011
3111111201012211002121022022012
4113122323031123030302023
5102000114430122332303
61003024001105250135
730460614436013534
oct2732731533146213
9444635732538265
10103005352152203
112a903362a45036
12b67716403394b
1345624947623c7
141b616b287768b
15bd9613d2b5d8
hex5daecd6ccc8b

103005352152203 has 2 divisors, whose sum is σ = 103005352152204. Its totient is φ = 103005352152202.

The previous prime is 103005352152139. The next prime is 103005352152221. The reversal of 103005352152203 is 302251253500301.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 103005352152203 - 26 = 103005352152139 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 103005352152203.

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

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

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

Almost surely, 2103005352152203 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 27000, while the sum is 32.

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