Search a number
-
+
101131223022919 is a prime number
BaseRepresentation
bin10110111111101001110010…
…100111111011110101000111
3111021002001100211000012102201
4112333221302213323311013
5101223413221043213134
6555031013102015331
730205326661163155
oct2677516247736507
9437061324005381
10101131223022919
112a250568a02441
12b413aa9b77547
1344578307ababb
141ad8ac4d283d5
15ba59c6431914
hex5bfa729fbd47

101131223022919 has 2 divisors, whose sum is σ = 101131223022920. Its totient is φ = 101131223022918.

The previous prime is 101131223022917. The next prime is 101131223022923. The reversal of 101131223022919 is 919220322131101.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 101131223022919 - 21 = 101131223022917 is a prime.

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

Together with 101131223022917, it forms a pair of twin primes.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (101131223022917) 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, 50565611511459 + 50565611511460.

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

Almost surely, 2101131223022919 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 11664, while the sum is 37.

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