Search a number
-
+
41201010223 is a prime number
BaseRepresentation
bin100110010111110001…
…011000011000101111
310221100100222011210121
4212113301120120233
51133334424311343
630532200345411
72655666544222
oct462761303057
9127310864717
1041201010223
111652299487a
127b9a175267
133b67b3b7b9
141dcbcc15b9
151112171aed
hex997c5862f

41201010223 has 2 divisors, whose sum is σ = 41201010224. Its totient is φ = 41201010222.

The previous prime is 41201010157. The next prime is 41201010259. The reversal of 41201010223 is 32201010214.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-41201010223 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 241201010223 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 96, while the sum is 16.

Adding to 41201010223 its reverse (32201010214), we get a palindrome (73402020437).

Subtracting from 41201010223 its reverse (32201010214), we obtain a palindrome (9000000009).

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