Base | Representation |
---|---|
bin | 1111110001110… |
… | …11101101000000 |
3 | 100020001211210212 |
4 | 13320323231000 |
5 | 232341140440 |
6 | 21045013252 |
7 | 3165041066 |
oct | 770735500 |
9 | 306054725 |
10 | 132365120 |
11 | 68797968 |
12 | 383b4228 |
13 | 21566174 |
14 | 13818036 |
15 | b949465 |
hex | 7e3bb40 |
132365120 has 56 divisors (see below), whose sum is σ = 320408808. Its totient is φ = 52070400.
The previous prime is 132365081. The next prime is 132365141. The reversal of 132365120 is 21563231.
It can be written as a sum of positive squares in 4 ways, for example, as 23104 + 132342016 = 152^2 + 11504^2 .
It is a super-2 number, since 2×1323651202 = 35041049985228800, which contains 22 as substring.
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, 16130 + ... + 22910.
Almost surely, 2132365120 is an apocalyptic number.
132365120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 132365120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (160204404).
132365120 is an abundant number, since it is smaller than the sum of its proper divisors (188043688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132365120 is an equidigital number, since it uses as much as digits as its factorization.
132365120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6859 (or 6849 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 132365120 is about 11505.0041286390. The cubic root of 132365120 is about 509.6333645833.
The spelling of 132365120 in words is "one hundred thirty-two million, three hundred sixty-five thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •