Base | Representation |
---|---|
bin | 111101100001110111… |
… | …1011110000111001110 |
3 | 110122001120120220010122 |
4 | 1323003233132013032 |
5 | 4131102023120420 |
6 | 140411233104542 |
7 | 12355244065610 |
oct | 1730357360716 |
9 | 418046526118 |
10 | 132133020110 |
11 | 51045710773 |
12 | 217370b8152 |
13 | c5c9a84200 |
14 | 65768acdb0 |
15 | 368524e725 |
hex | 1ec3bde1ce |
132133020110 has 48 divisors (see below), whose sum is σ = 294333867936. Its totient is φ = 41817919104.
The previous prime is 132133020109. The next prime is 132133020161. The reversal of 132133020110 is 11020331231.
132133020110 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 23 ways as a sum of consecutive naturals, for example, 5572829 + ... + 5596488.
It is an arithmetic number, because the mean of its divisors is an integer number (6131955582).
Almost surely, 2132133020110 is an apocalyptic number.
132133020110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132133020110 is an abundant number, since it is smaller than the sum of its proper divisors (162200847826).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132133020110 is a wasteful number, since it uses less digits than its factorization.
132133020110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11169357 (or 11169344 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 132133020110 its reverse (11020331231), we get a palindrome (143153351341).
The spelling of 132133020110 in words is "one hundred thirty-two billion, one hundred thirty-three million, twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •