Search a number
-
+
103223646641 is a prime number
BaseRepresentation
bin110000000100010011…
…0111101100110110001
3100212102211111120002202
41200020212331212301
53142400223143031
6115230440552545
710312656343133
oct1401046754661
9325384446082
10103223646641
113a86006a585
1218009482755
13997063a46b
144dd3243053
152a422592cb
hex18089bd9b1

103223646641 has 2 divisors, whose sum is σ = 103223646642. Its totient is φ = 103223646640.

The previous prime is 103223646637. The next prime is 103223646649. The reversal of 103223646641 is 146646322301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 103166870416 + 56776225 = 321196^2 + 7535^2 .

It is a cyclic number.

It is not a de Polignac number, because 103223646641 - 22 = 103223646637 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 103223646595 and 103223646604.

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

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

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

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

Almost surely, 2103223646641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 124416, while the sum is 38.

Adding to 103223646641 its reverse (146646322301), we get a palindrome (249869968942).

The spelling of 103223646641 in words is "one hundred three billion, two hundred twenty-three million, six hundred forty-six thousand, six hundred forty-one".