Search a number
-
+
1033013020032 = 27327221118669
BaseRepresentation
bin11110000100001000101…
…11111100010110000000
310122202101110020121022200
433002010113330112000
5113411102313120112
62110320514033200
7134430011535600
oct17020427742600
93582343217280
101033013020032
11369109a12524
12148255b78800
1376549953516
1437dd8ac6c00
151bd0eb56cdc
hexf0845fc580

1033013020032 has 288 divisors, whose sum is σ = 3459962563200. Its totient is φ = 294972733440.

The previous prime is 1033013020031. The next prime is 1033013020043. The reversal of 1033013020032 is 2300203103301.

1033013020032 is a `hidden beast` number, since 1 + 0 + 330 + 1 + 302 + 0 + 0 + 32 = 666.

It is a tau number, because it is divible by the number of its divisors (288).

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

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

It is a congruent number.

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

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 35 ways as a sum of consecutive naturals, for example, 119157394 + ... + 119166062.

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

Almost surely, 21033013020032 is an apocalyptic number.

1033013020032 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 1033013020032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1729981281600).

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

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

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

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

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

The product of its (nonzero) digits is 324, while the sum is 18.

Adding to 1033013020032 its reverse (2300203103301), we get a palindrome (3333216123333).

The spelling of 1033013020032 in words is "one trillion, thirty-three billion, thirteen million, twenty thousand, thirty-two".