Base | Representation |
---|---|
bin | 111101100001001111… |
… | …1101011001011011110 |
3 | 110122000010020011000220 |
4 | 1323002133223023132 |
5 | 4131031144231420 |
6 | 140405204502210 |
7 | 12354601224312 |
oct | 1730237531336 |
9 | 418003204026 |
10 | 132112102110 |
11 | 5103492376a |
12 | 217300aa966 |
13 | c5c563bcb1 |
14 | 6573bc5b42 |
15 | 36834bb840 |
hex | 1ec27eb2de |
132112102110 has 64 divisors (see below), whose sum is σ = 321560755200. Its totient is φ = 34732144512.
The previous prime is 132112102069. The next prime is 132112102139. The reversal of 132112102110 is 11201211231.
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 132112102110.
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 31 ways as a sum of consecutive naturals, for example, 1563321 + ... + 1645659.
It is an arithmetic number, because the mean of its divisors is an integer number (5024386800).
Almost surely, 2132112102110 is an apocalyptic number.
132112102110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132112102110 is an abundant number, since it is smaller than the sum of its proper divisors (189448653090).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132112102110 is a wasteful number, since it uses less digits than its factorization.
132112102110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83105.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 132112102110 its reverse (11201211231), we get a palindrome (143313313341).
The spelling of 132112102110 in words is "one hundred thirty-two billion, one hundred twelve million, one hundred two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •