Base | Representation |
---|---|
bin | 1111110000010… |
… | …10001000001000 |
3 | 100012200112020222 |
4 | 13320022020020 |
5 | 232313141211 |
6 | 21040405212 |
7 | 3163234055 |
oct | 770121010 |
9 | 305615228 |
10 | 132162056 |
11 | 68669344 |
12 | 38316808 |
13 | 214c4900 |
14 | 137a402c |
15 | b9091db |
hex | 7e0a208 |
132162056 has 48 divisors (see below), whose sum is σ = 272523600. Its totient is φ = 60046272.
The previous prime is 132162053. The next prime is 132162061. The reversal of 132162056 is 650261231.
It is a super-2 number, since 2×1321620562 = 34933618092294272, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is not an unprimeable number, because it can be changed into a prime (132162053) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 89855 + ... + 91313.
It is an arithmetic number, because the mean of its divisors is an integer number (5677575).
Almost surely, 2132162056 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 132162056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136261800).
132162056 is an abundant number, since it is smaller than the sum of its proper divisors (140361544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132162056 is a wasteful number, since it uses less digits than its factorization.
132162056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1558 (or 1541 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 132162056 is about 11496.1757119487. The cubic root of 132162056 is about 509.3726182583.
The spelling of 132162056 in words is "one hundred thirty-two million, one hundred sixty-two thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •