Base | Representation |
---|---|
bin | 1111110000101… |
… | …01110111001000 |
3 | 100012202222012010 |
4 | 13320111313020 |
5 | 232321210440 |
6 | 21041415520 |
7 | 3163524150 |
oct | 770256710 |
9 | 305688163 |
10 | 132210120 |
11 | 686a1469 |
12 | 3833a5a0 |
13 | 21510753 |
14 | 137b7760 |
15 | b918580 |
hex | 7e15dc8 |
132210120 has 64 divisors (see below), whose sum is σ = 453294720. Its totient is φ = 30219264.
The previous prime is 132210103. The next prime is 132210137. The reversal of 132210120 is 21012231.
It is an interprime number because it is at equal distance from previous prime (132210103) and next prime (132210137).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 132210096 and 132210105.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 77857 + ... + 79536.
It is an arithmetic number, because the mean of its divisors is an integer number (7082730).
Almost surely, 2132210120 is an apocalyptic number.
132210120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132210120 is an abundant number, since it is smaller than the sum of its proper divisors (321084600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132210120 is a wasteful number, since it uses less digits than its factorization.
132210120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157414 (or 157410 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 132210120 is about 11498.2659562214. The cubic root of 132210120 is about 509.4343594241.
Adding to 132210120 its reverse (21012231), we get a palindrome (153222351).
The spelling of 132210120 in words is "one hundred thirty-two million, two hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •