10433503122 has 64 divisors (see below), whose sum is σ = 24069602304. Its totient is φ = 2953379520.

The previous prime is 10433503099. The next prime is 10433503147. The reversal of 10433503122 is 22130533401.

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

It is an unprimeable number.

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 31 ways as a sum of consecutive naturals, for example, 4549008 + ... + 4551300.

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

Almost surely, 2^10433503122 is an apocalyptic number.

10433503122 is an abundant number, since it is smaller than the sum of its proper divisors (13636099182).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 3263.

The product of its (nonzero) digits is 2160, while the sum is 24.

The spelling of 10433503122 in words is "ten billion, four hundred thirty-three million, five hundred three thousand, one hundred twenty-two".