Search a number
-
+
120131111323 is a prime number
BaseRepresentation
bin110111111100001011…
…1110100100110011011
3102111002010212202102101
41233320113310212123
53432012031030243
6131104254344231
711451650412106
oct1577027644633
9374063782371
10120131111323
1146a46975a93
121b3477bb077
13b436401932
145b5891573d
1531d175354d
hex1bf85f499b

120131111323 has 2 divisors, whose sum is σ = 120131111324. Its totient is φ = 120131111322.

The previous prime is 120131111291. The next prime is 120131111327. The reversal of 120131111323 is 323111131021.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 120131111323 - 25 = 120131111291 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 120131111323.

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

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

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

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

Almost surely, 2120131111323 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 108, while the sum is 19.

Adding to 120131111323 its reverse (323111131021), we get a palindrome (443242242344).

The spelling of 120131111323 in words is "one hundred twenty billion, one hundred thirty-one million, one hundred eleven thousand, three hundred twenty-three".