321111323111123 has 16 divisors (see below), whose sum is σ = 342181744128000. Its totient is φ = 300465323370432.

The previous prime is 321111323111113. The next prime is 321111323111153.

321111323111123 is nontrivially palindromic in base 10.

It is a cyclic number.

It is not a de Polignac number, because 321111323111123 - 2⁴ = 321111323111107 is a prime.

It is a super-2 number, since 2×321111323111123² (a number of 30 digits) contains 22 as substring.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (321111323111113) 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 in 15 ways as a sum of consecutive naturals, for example, 101761715 + ... + 104869772.

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

Almost surely, 2^{321111323111123} is an apocalyptic number.

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

321111323111123 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 206632514.

The product of its digits is 648, while the sum is 26.

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