Search a number
-
+
103011021361 is a prime number
BaseRepresentation
bin101111111101111101…
…1110111001000110001
3100211220000102002001101
41133323323313020301
53141431310140421
6115153403404401
710304465143303
oct1377373671061
9324800362041
10103011021361
113a761044006
1217b6a223701
1399385826a1
144db2cd5973
152a2d759191
hex17fbef7231

103011021361 has 2 divisors, whose sum is σ = 103011021362. Its totient is φ = 103011021360.

The previous prime is 103011021299. The next prime is 103011021391. The reversal of 103011021361 is 163120110301.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 100271022336 + 2739999025 = 316656^2 + 52345^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 103011021361 - 27 = 103011021233 is a prime.

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

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

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

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

Almost surely, 2103011021361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 108, while the sum is 19.

Adding to 103011021361 its reverse (163120110301), we get a palindrome (266131131662).

The spelling of 103011021361 in words is "one hundred three billion, eleven million, twenty-one thousand, three hundred sixty-one".