Search a number
-
+
101023233130223 is a prime number
BaseRepresentation
bin10110111110000101001101…
…111011001011111011101111
3111020200201121210222020220022
4112332011031323023323233
5101220131040140131343
6554505233235512355
730164454615221645
oct2676051573137357
9436621553866808
10101023233130223
112a209792482738
12b3b6b904586bb
13444a5b0887901
141ad379cab1195
15ba2ca5a46568
hex5be14decbeef

101023233130223 has 2 divisors, whose sum is σ = 101023233130224. Its totient is φ = 101023233130222.

The previous prime is 101023233130159. The next prime is 101023233130231. The reversal of 101023233130223 is 322031332320101.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 101023233130223 - 26 = 101023233130159 is a prime.

It is a Sophie Germain prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2101023233130223 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3888, while the sum is 26.

Adding to 101023233130223 its reverse (322031332320101), we get a palindrome (423054565450324).

The spelling of 101023233130223 in words is "one hundred one trillion, twenty-three billion, two hundred thirty-three million, one hundred thirty thousand, two hundred twenty-three".