Base | Representation |
---|---|
bin | 111101101000001000… |
… | …1011001010101011000 |
3 | 110122121020011011122101 |
4 | 1323100101121111120 |
5 | 4132014332140044 |
6 | 140444142533144 |
7 | 12363405656632 |
oct | 1732021312530 |
9 | 418536134571 |
10 | 132343240024 |
11 | 51143344036 |
12 | 217955971b4 |
13 | c6314a91a8 |
14 | 6596791a52 |
15 | 3698926cd4 |
hex | 1ed0459558 |
132343240024 has 48 divisors (see below), whose sum is σ = 268993104120. Its totient is φ = 60830703360.
The previous prime is 132343240021. The next prime is 132343240027. The reversal of 132343240024 is 420042343231.
It is an interprime number because it is at equal distance from previous prime (132343240021) and next prime (132343240027).
It is a junction number, because it is equal to n+sod(n) for n = 132343239974 and 132343240001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132343240021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11682 + ... + 514609.
Almost surely, 2132343240024 is an apocalyptic number.
It is an amenable number.
132343240024 is an abundant number, since it is smaller than the sum of its proper divisors (136649864096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132343240024 is a wasteful number, since it uses less digits than its factorization.
132343240024 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 526400 (or 526353 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 132343240024 its reverse (420042343231), we get a palindrome (552385583255).
The spelling of 132343240024 in words is "one hundred thirty-two billion, three hundred forty-three million, two hundred forty thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •