Base | Representation |
---|---|
bin | 111101101000001000… |
… | …0100100011010000000 |
3 | 110122121012202011021001 |
4 | 1323100100210122000 |
5 | 4132014303220412 |
6 | 140444134141344 |
7 | 12363404064610 |
oct | 1732020443200 |
9 | 418535664231 |
10 | 132343023232 |
11 | 51143206172 |
12 | 217954b1854 |
13 | c631431604 |
14 | 6596736a40 |
15 | 36988d2957 |
hex | 1ed0424680 |
132343023232 has 64 divisors (see below), whose sum is σ = 301432227840. Its totient is φ = 56696693760.
The previous prime is 132343023227. The next prime is 132343023269. The reversal of 132343023232 is 232320343231.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 132343023232.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2428993 + ... + 2482879.
It is an arithmetic number, because the mean of its divisors is an integer number (4709878560).
Almost surely, 2132343023232 is an apocalyptic number.
It is an amenable number.
132343023232 is an abundant number, since it is smaller than the sum of its proper divisors (169089204608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132343023232 is an equidigital number, since it uses as much as digits as its factorization.
132343023232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56649 (or 56637 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 28.
Adding to 132343023232 its reverse (232320343231), we get a palindrome (364663366463).
The spelling of 132343023232 in words is "one hundred thirty-two billion, three hundred forty-three million, twenty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •