Base | Representation |
---|---|
bin | 11110000010010101010… |
… | …00101100001111110100 |
3 | 10122122212221111011011220 |
4 | 33001022220230033310 |
5 | 113402111322111040 |
6 | 2110040431430340 |
7 | 134364010036362 |
oct | 17011250541764 |
9 | 3578787434156 |
10 | 1032044332020 |
11 | 368762135919 |
12 | 1480256853b0 |
13 | 7642405a550 |
14 | 37d461aa632 |
15 | 1bca4aad2d0 |
hex | f04aa2c3f4 |
1032044332020 has 48 divisors (see below), whose sum is σ = 3112010603520. Its totient is φ = 254041681536.
The previous prime is 1032044332019. The next prime is 1032044332027. The reversal of 1032044332020 is 202334402301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1032044332027) 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 15 ways as a sum of consecutive naturals, for example, 661566100 + ... + 661567659.
It is an arithmetic number, because the mean of its divisors is an integer number (64833554240).
Almost surely, 21032044332020 is an apocalyptic number.
1032044332020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1032044332020 is an abundant number, since it is smaller than the sum of its proper divisors (2079966271500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1032044332020 is a wasteful number, since it uses less digits than its factorization.
1032044332020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1323133784 (or 1323133782 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 1032044332020 its reverse (202334402301), we get a palindrome (1234378734321).
The spelling of 1032044332020 in words is "one trillion, thirty-two billion, forty-four million, three hundred thirty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •