Base | Representation |
---|---|
bin | 10000011110100100001… |
… | …000100111001101000000 |
3 | 11000020202000220000211121 |
4 | 100132210020213031000 |
5 | 122023003002320000 |
6 | 2224104004122024 |
7 | 144544124133112 |
oct | 20364410471500 |
9 | 4006660800747 |
10 | 1132330120000 |
11 | 3a7244918732 |
12 | 163553096314 |
13 | 82a16b2ccb1 |
14 | 3cb3b1813b2 |
15 | 1e6c3e4ab1a |
hex | 107a4227340 |
1132330120000 has 70 divisors (see below), whose sum is σ = 2807810789498. Its totient is φ = 452932032000.
The previous prime is 1132330119997. The next prime is 1132330120001. The reversal of 1132330120000 is 210332311.
It can be written as a sum of positive squares in 5 ways, for example, as 439759964736 + 692570155264 = 663144^2 + 832208^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132330120001) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 14114127 + ... + 14194126.
Almost surely, 21132330120000 is an apocalyptic number.
1132330120000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1132330120000 is an abundant number, since it is smaller than the sum of its proper divisors (1675480669498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1132330120000 is an frugal number, since it uses more digits than its factorization.
1132330120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28308285 (or 28308260 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1132330120000 its reverse (210332311), we get a palindrome (1132540452311).
The spelling of 1132330120000 in words is "one trillion, one hundred thirty-two billion, three hundred thirty million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •