Base | Representation |
---|---|
bin | 111101011110010011… |
… | …0011110010010100110 |
3 | 110121202020011110200200 |
4 | 1322330212132102212 |
5 | 4130330341033110 |
6 | 140351313251330 |
7 | 12352260602265 |
oct | 1727446362246 |
9 | 417666143620 |
10 | 132013221030 |
11 | 50a94026969 |
12 | 21702b63b46 |
13 | c5aacca892 |
14 | 6564a065dc |
15 | 36799886c0 |
hex | 1ebc99e4a6 |
132013221030 has 48 divisors (see below), whose sum is σ = 363424636224. Its totient is φ = 33132729600.
The previous prime is 132013221029. The next prime is 132013221071. The reversal of 132013221030 is 30122310231.
132013221030 is a `hidden beast` number, since 1 + 320 + 132 + 210 + 3 + 0 = 666.
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 = 132013220994 and 132013221012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 43140046 + ... + 43143105.
It is an arithmetic number, because the mean of its divisors is an integer number (7571346588).
Almost surely, 2132013221030 is an apocalyptic number.
132013221030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132013221030 is an abundant number, since it is smaller than the sum of its proper divisors (231411415194).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132013221030 is a wasteful number, since it uses less digits than its factorization.
132013221030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86283181 (or 86283178 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 132013221030 its reverse (30122310231), we get a palindrome (162135531261).
The spelling of 132013221030 in words is "one hundred thirty-two billion, thirteen million, two hundred twenty-one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •