321111020111123 has 6 divisors (see below), whose sum is σ = 352956741114012. Its totient is φ = 291919109191820.

The previous prime is 321111020111083. The next prime is 321111020111179.

321111020111123 is nontrivially palindromic in base 10.

It is not a de Polignac number, because 321111020111123 - 2¹⁶ = 321111020045587 is a prime.

It is a super-2 number, since 2×321111020111123² (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 = 321111020111095 and 321111020111104.

It is not an unprimeable number, because it can be changed into a prime (321111020111023) by changing a digit.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1326905041661 + ... + 1326905041902.

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

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

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

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

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

The sum of its prime factors is 2653810083585 (or 2653810083574 counting only the distinct ones).

The product of its (nonzero) digits is 72, while the sum is 20.

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