Base | Representation |
---|---|
bin | 11101100100100101001… |
… | …111000101000101111100 |
3 | 21012021022121220111001021 |
4 | 131210211033011011330 |
5 | 231243312411203040 |
6 | 4153315411353524 |
7 | 266550300021325 |
oct | 35444517050574 |
9 | 7167277814037 |
10 | 2032144241020 |
11 | 71391149a933 |
12 | 289a14bb28a4 |
13 | 119826c3732a |
14 | 704db9bd44c |
15 | 37cd9eac24a |
hex | 1d9253c517c |
2032144241020 has 48 divisors (see below), whose sum is σ = 4334383232928. Its totient is φ = 800136437760.
The previous prime is 2032144240979. The next prime is 2032144241021. The reversal of 2032144241020 is 201424412302.
It is a super-2 number, since 2×20321442410202 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2032144241021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1266604 + ... + 2380876.
It is an arithmetic number, because the mean of its divisors is an integer number (90299650686).
Almost surely, 22032144241020 is an apocalyptic number.
2032144241020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2032144241020 is an abundant number, since it is smaller than the sum of its proper divisors (2302238991908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2032144241020 is a wasteful number, since it uses less digits than its factorization.
2032144241020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1115710 (or 1115708 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 2032144241020 its reverse (201424412302), we get a palindrome (2233568653322).
The spelling of 2032144241020 in words is "two trillion, thirty-two billion, one hundred forty-four million, two hundred forty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •