Base | Representation |
---|---|
bin | 1111110000101… |
… | …10111111000000 |
3 | 100012210012111111 |
4 | 13320112333000 |
5 | 232321332340 |
6 | 21041453104 |
7 | 3163543441 |
oct | 770267700 |
9 | 305705444 |
10 | 132214720 |
11 | 686a4970 |
12 | 38341194 |
13 | 21512881 |
14 | 137b92c8 |
15 | b919aea |
hex | 7e16fc0 |
132214720 has 56 divisors (see below), whose sum is σ = 343466928. Its totient is φ = 48076800.
The previous prime is 132214717. The next prime is 132214759. The reversal of 132214720 is 27412231.
It is a super-3 number, since 3×1322147203 (a number of 25 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 132214691 and 132214700.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15261 + ... + 22300.
It is an arithmetic number, because the mean of its divisors is an integer number (6133338).
Almost surely, 2132214720 is an apocalyptic number.
132214720 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132214720 is an abundant number, since it is smaller than the sum of its proper divisors (211252208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132214720 is a wasteful number, since it uses less digits than its factorization.
132214720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37589 (or 37579 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 22.
The square root of 132214720 is about 11498.4659846433. The cubic root of 132214720 is about 509.4402676225.
Adding to 132214720 its reverse (27412231), we get a palindrome (159626951).
The spelling of 132214720 in words is "one hundred thirty-two million, two hundred fourteen thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •