Search a number
-
+
101423323212223 is a prime number
BaseRepresentation
bin10111000011111001110101…
…001001101110100110111111
3111022002222022210001021011111
4113003321311021232212333
5101243204431220242343
6555413121554502451
730235410332626465
oct2703716511564677
9438088283037144
10101423323212223
112a353431941a71
12b460629894a27
134479241a762bc
141b08cb4c02835
15bad3c02d5c9d
hex5c3e7526e9bf

101423323212223 has 2 divisors, whose sum is σ = 101423323212224. Its totient is φ = 101423323212222.

The previous prime is 101423323212191. The next prime is 101423323212241. The reversal of 101423323212223 is 322212323324101.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 101423323212223 - 25 = 101423323212191 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2101423323212223 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 20736, while the sum is 31.

Adding to 101423323212223 its reverse (322212323324101), we get a palindrome (423635646536324).

The spelling of 101423323212223 in words is "one hundred one trillion, four hundred twenty-three billion, three hundred twenty-three million, two hundred twelve thousand, two hundred twenty-three".