Base | Representation |
---|---|
bin | 11101100100100100011… |
… | …000111000010111100000 |
3 | 21012021021122011122110202 |
4 | 131210210120320113200 |
5 | 231243300242024440 |
6 | 4153314143044332 |
7 | 266550035165015 |
oct | 35444430702740 |
9 | 7167248148422 |
10 | 2032130033120 |
11 | 713904476270 |
12 | 289a102a06a8 |
13 | 1198240013a5 |
14 | 704d9b6170c |
15 | 37cd8b02615 |
hex | 1d9246385e0 |
2032130033120 has 48 divisors (see below), whose sum is σ = 5237353317168. Its totient is φ = 738956375040.
The previous prime is 2032130033117. The next prime is 2032130033179. The reversal of 2032130033120 is 213300312302.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 2032130033092 and 2032130033101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 577307909 + ... + 577311428.
It is an arithmetic number, because the mean of its divisors is an integer number (109111527441).
Almost surely, 22032130033120 is an apocalyptic number.
2032130033120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2032130033120 is an abundant number, since it is smaller than the sum of its proper divisors (3205223284048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2032130033120 is a wasteful number, since it uses less digits than its factorization.
2032130033120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1154619363 (or 1154619355 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 2032130033120 its reverse (213300312302), we get a palindrome (2245430345422).
The spelling of 2032130033120 in words is "two trillion, thirty-two billion, one hundred thirty million, thirty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •