Base | Representation |
---|---|
bin | 111101100000111110… |
… | …1000010001001000010 |
3 | 110121222111010210021000 |
4 | 1323001331002021002 |
5 | 4131021333133442 |
6 | 140404242112430 |
7 | 12354431103162 |
oct | 1730175021102 |
9 | 417874123230 |
10 | 132103021122 |
11 | 5102a791016 |
12 | 2172904b716 |
13 | c5c37ac827 |
14 | 65729005a2 |
15 | 36827c5d4c |
hex | 1ec1f42242 |
132103021122 has 64 divisors (see below), whose sum is σ = 306451537920. Its totient is φ = 42102522000.
The previous prime is 132103021111. The next prime is 132103021147. The reversal of 132103021122 is 221120301231.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 132103021095 and 132103021104.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3197497 + ... + 3238547.
It is an arithmetic number, because the mean of its divisors is an integer number (4788305280).
Almost surely, 2132103021122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 132103021122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153225768960).
132103021122 is an abundant number, since it is smaller than the sum of its proper divisors (174348516798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132103021122 is a wasteful number, since it uses less digits than its factorization.
132103021122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43676 (or 43670 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 132103021122 its reverse (221120301231), we get a palindrome (353223322353).
The spelling of 132103021122 in words is "one hundred thirty-two billion, one hundred three million, twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •