Base | Representation |
---|---|
bin | 11110000010010010011… |
… | …01000101111100000000 |
3 | 10122122211021022012212211 |
4 | 33001021031011330000 |
5 | 113402034200220000 |
6 | 2110034213031504 |
7 | 134363265660445 |
oct | 17011115057400 |
9 | 3578737265784 |
10 | 1032020320000 |
11 | 36874a62527a |
12 | 148019625594 |
13 | 7641c0a0c57 |
14 | 37d42d199cc |
15 | 1bca29187ba |
hex | f049345f00 |
1032020320000 has 180 divisors, whose sum is σ = 2576713481496. Its totient is φ = 412403200000.
The previous prime is 1032020319983. The next prime is 1032020320007. The reversal of 1032020320000 is 230202301.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1032020320007) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 204317475 + ... + 204322525.
Almost surely, 21032020320000 is an apocalyptic number.
1032020320000 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 1032020320000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1288356740748).
1032020320000 is an abundant number, since it is smaller than the sum of its proper divisors (1544693161496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1032020320000 is an frugal number, since it uses more digits than its factorization.
1032020320000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6364 (or 6335 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 13.
Adding to 1032020320000 its reverse (230202301), we get a palindrome (1032250522301).
The spelling of 1032020320000 in words is "one trillion, thirty-two billion, twenty million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •