2303220111023 has 6 divisors (see below), whose sum is σ = 2494019410344. Its totient is φ = 2126049333096.

The previous prime is 2303220111013. The next prime is 2303220111037. The reversal of 2303220111023 is 3201110223032.

2303220111023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 2303220111023 - 2⁴ = 2303220111007 is a prime.

It is a super-2 number, since 2×2303220111023² (a number of 26 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 = 2303220110986 and 2303220111004.

It is a congruent number.

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

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

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

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

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

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

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

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

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

Adding to 2303220111023 its reverse (3201110223032), we get a palindrome (5504330334055).

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