Base | Representation |
---|---|
bin | 111101101000000110… |
… | …0101101010011110000 |
3 | 110122121010211201220102 |
4 | 1323100030231103300 |
5 | 4132014023323440 |
6 | 140444100331532 |
7 | 12363362351054 |
oct | 1732014552360 |
9 | 418533751812 |
10 | 132342011120 |
11 | 51142684810 |
12 | 217950a3ba8 |
13 | c631168a27 |
14 | 6596551c64 |
15 | 3698782b15 |
hex | 1ed032d4f0 |
132342011120 has 80 divisors (see below), whose sum is σ = 338638227552. Its totient is φ = 47698452480.
The previous prime is 132342011083. The next prime is 132342011129. The reversal of 132342011120 is 21110243231.
It is a tau number, because it is divible by the number of its divisors (80).
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 = 132342011092 and 132342011101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132342011129) 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, 565997 + ... + 764876.
Almost surely, 2132342011120 is an apocalyptic number.
132342011120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132342011120 is an abundant number, since it is smaller than the sum of its proper divisors (206296216432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132342011120 is a wasteful number, since it uses less digits than its factorization.
132342011120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1331010 (or 1331004 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 132342011120 its reverse (21110243231), we get a palindrome (153452254351).
The spelling of 132342011120 in words is "one hundred thirty-two billion, three hundred forty-two million, eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •