Base | Representation |
---|---|
bin | 111101011110111000… |
… | …1111110000110011000 |
3 | 110121210121101221222000 |
4 | 1322331301332012120 |
5 | 4130400422341440 |
6 | 140353301401000 |
7 | 12352621041252 |
oct | 1727561760630 |
9 | 417717357860 |
10 | 132033012120 |
11 | 50aa4214239 |
12 | 21709709160 |
13 | c5b2139b99 |
14 | 65674b8cd2 |
15 | 367b597730 |
hex | 1ebdc7e198 |
132033012120 has 64 divisors (see below), whose sum is σ = 440110044000. Its totient is φ = 35208802944.
The previous prime is 132033012109. The next prime is 132033012121. The reversal of 132033012120 is 21210330231.
132033012120 is a `hidden beast` number, since 1 + 320 + 3 + 301 + 21 + 20 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 132033012093 and 132033012102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132033012121) 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, 61125315 + ... + 61127474.
Almost surely, 2132033012120 is an apocalyptic number.
132033012120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132033012120 is an abundant number, since it is smaller than the sum of its proper divisors (308077031880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132033012120 is a wasteful number, since it uses less digits than its factorization.
132033012120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122252809 (or 122252799 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 132033012120 its reverse (21210330231), we get a palindrome (153243342351).
The spelling of 132033012120 in words is "one hundred thirty-two billion, thirty-three million, twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •