Base | Representation |
---|---|
bin | 1111110001011… |
… | …00110011101110 |
3 | 100012221202010020 |
4 | 13320230303232 |
5 | 232332212420 |
6 | 21043423010 |
7 | 3164365161 |
oct | 770546356 |
9 | 305852106 |
10 | 132304110 |
11 | 68756044 |
12 | 38384a66 |
13 | 21544473 |
14 | 137ddad8 |
15 | b936340 |
hex | 7e2ccee |
132304110 has 16 divisors (see below), whose sum is σ = 317529936. Its totient is φ = 35281088.
The previous prime is 132304093. The next prime is 132304121. The reversal of 132304110 is 11403231.
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 132304110.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2205039 + ... + 2205098.
It is an arithmetic number, because the mean of its divisors is an integer number (19845621).
Almost surely, 2132304110 is an apocalyptic number.
132304110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132304110 is an abundant number, since it is smaller than the sum of its proper divisors (185225826).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132304110 is a wasteful number, since it uses less digits than its factorization.
132304110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4410147.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 132304110 is about 11502.3523681028. The cubic root of 132304110 is about 509.5550521349. Note that the first 3 decimals are identical.
Adding to 132304110 its reverse (11403231), we get a palindrome (143707341).
The spelling of 132304110 in words is "one hundred thirty-two million, three hundred four thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •