Base | Representation |
---|---|
bin | 111101011110111000… |
… | …0001110011000100010 |
3 | 110121210120112201021020 |
4 | 1322331300032120202 |
5 | 4130400313221110 |
6 | 140353243510310 |
7 | 12352614124212 |
oct | 1727560163042 |
9 | 417716481236 |
10 | 132032554530 |
11 | 50aa3a31468 |
12 | 21709528396 |
13 | c5b2009816 |
14 | 65673da242 |
15 | 367b506d70 |
hex | 1ebdc0e622 |
132032554530 has 16 divisors (see below), whose sum is σ = 316878130944. Its totient is φ = 35208681200.
The previous prime is 132032554517. The next prime is 132032554531. The reversal of 132032554530 is 35455230231.
It is a junction number, because it is equal to n+sod(n) for n = 132032554491 and 132032554500.
It is not an unprimeable number, because it can be changed into a prime (132032554531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2200542546 + ... + 2200542605.
It is an arithmetic number, because the mean of its divisors is an integer number (19804883184).
Almost surely, 2132032554530 is an apocalyptic number.
132032554530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132032554530 is an abundant number, since it is smaller than the sum of its proper divisors (184845576414).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132032554530 is a wasteful number, since it uses less digits than its factorization.
132032554530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4401085161.
The product of its (nonzero) digits is 54000, while the sum is 33.
Adding to 132032554530 its reverse (35455230231), we get a palindrome (167487784761).
The spelling of 132032554530 in words is "one hundred thirty-two billion, thirty-two million, five hundred fifty-four thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •