Base | Representation |
---|---|
bin | 111101100111011100… |
… | …1001000001011110110 |
3 | 110122112121121121000120 |
4 | 1323032321020023312 |
5 | 4131442421213420 |
6 | 140441554552410 |
7 | 12363005205351 |
oct | 1731671101366 |
9 | 418477547016 |
10 | 132320101110 |
11 | 5113127a46a |
12 | 21789898706 |
13 | c629767122 |
14 | 659368b298 |
15 | 36968a5d40 |
hex | 1ecee482f6 |
132320101110 has 16 divisors (see below), whose sum is σ = 317568242736. Its totient is φ = 35285360288.
The previous prime is 132320101091. The next prime is 132320101117. The reversal of 132320101110 is 11101023231.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 132320101110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132320101117) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2205334989 + ... + 2205335048.
It is an arithmetic number, because the mean of its divisors is an integer number (19848015171).
Almost surely, 2132320101110 is an apocalyptic number.
132320101110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132320101110 is an abundant number, since it is smaller than the sum of its proper divisors (185248141626).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132320101110 is a wasteful number, since it uses less digits than its factorization.
132320101110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4410670047.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 132320101110 its reverse (11101023231), we get a palindrome (143421124341).
The spelling of 132320101110 in words is "one hundred thirty-two billion, three hundred twenty million, one hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •