1034212123032 has 128 divisors (see below), whose sum is σ = 2881300930560. Its totient is φ = 306653973120.

The previous prime is 1034212123027. The next prime is 1034212123033. The reversal of 1034212123032 is 2303212124301.

It is a Harshad number since it is a multiple of its sum of digits (24).

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1034212123033) 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 31 ways as a sum of consecutive naturals, for example, 69018213 + ... + 69033195.

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

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

1034212123032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 1034212123032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1440650465280).

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

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

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

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

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

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

Adding to 1034212123032 its reverse (2303212124301), we get a palindrome (3337424247333).

The spelling of 1034212123032 in words is "one trillion, thirty-four billion, two hundred twelve million, one hundred twenty-three thousand, thirty-two".