Search a number
-
+
1012032120000 = 26354111017591
BaseRepresentation
bin11101011101000011101…
…00001010010011000000
310120202020020222110012010
432232201310022103000
5113040120210320000
62052530544332520
7133055046041046
oct16564164122300
93522206873163
101012032120000
11360222825820
1214417b614140
1374584c98285
1436da8426396
151b4d2c2dd50
hexeba1d0a4c0

1012032120000 has 560 divisors, whose sum is σ = 3686823638784. Its totient is φ = 242880000000.

The previous prime is 1012032119981. The next prime is 1012032120031. The reversal of 1012032120000 is 212302101.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 133316205 + ... + 133323795.

Almost surely, 21012032120000 is an apocalyptic number.

1012032120000 is a gapful number since it is divisible by the number (10) 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 1012032120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1843411819392).

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

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

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

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

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

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

Adding to 1012032120000 its reverse (212302101), we get a palindrome (1012244422101).

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