Base | Representation |
---|---|
bin | 111101011101111100… |
… | …0101111000010110110 |
3 | 110121201101121022111121 |
4 | 1322323320233002312 |
5 | 4130314303343110 |
6 | 140350204254154 |
7 | 12352053644104 |
oct | 1727370570266 |
9 | 417641538447 |
10 | 132001231030 |
11 | 50a88287679 |
12 | 216bab4135a |
13 | c5a86902c6 |
14 | 65631a4c74 |
15 | 36788bacda |
hex | 1ebbe2f0b6 |
132001231030 has 8 divisors (see below), whose sum is σ = 237602215872. Its totient is φ = 52800492408.
The previous prime is 132001231007. The next prime is 132001231051. The reversal of 132001231030 is 30132100231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 132001230995 and 132001231013.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6600061542 + ... + 6600061561.
It is an arithmetic number, because the mean of its divisors is an integer number (29700276984).
Almost surely, 2132001231030 is an apocalyptic number.
132001231030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132001231030 is a deficient number, since it is larger than the sum of its proper divisors (105600984842).
132001231030 is a wasteful number, since it uses less digits than its factorization.
132001231030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13200123110.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 132001231030 its reverse (30132100231), we get a palindrome (162133331261).
The spelling of 132001231030 in words is "one hundred thirty-two billion, one million, two hundred thirty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.606 sec. • engine limits •