Base | Representation |
---|---|
bin | 111101011111001101… |
… | …0100001110110110101 |
3 | 110121211100102010121222 |
4 | 1322332122201312311 |
5 | 4130411133104331 |
6 | 140354321320125 |
7 | 12353110313060 |
oct | 1727632416665 |
9 | 417740363558 |
10 | 132043644341 |
11 | 50aaa2163a4 |
12 | 21711196045 |
13 | c5b43c043b |
14 | 6568a858d7 |
15 | 367c497b7b |
hex | 1ebe6a1db5 |
132043644341 has 8 divisors (see below), whose sum is σ = 151093563840. Its totient is φ = 113040360288.
The previous prime is 132043644319. The next prime is 132043644353. The reversal of 132043644341 is 143446340231.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132043644341 - 230 = 130969902517 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132043644041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11652791 + ... + 11664116.
It is an arithmetic number, because the mean of its divisors is an integer number (18886695480).
Almost surely, 2132043644341 is an apocalyptic number.
It is an amenable number.
132043644341 is a deficient number, since it is larger than the sum of its proper divisors (19049919499).
132043644341 is an equidigital number, since it uses as much as digits as its factorization.
132043644341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23317723.
The product of its (nonzero) digits is 82944, while the sum is 35.
Adding to 132043644341 its reverse (143446340231), we get a palindrome (275489984572).
The spelling of 132043644341 in words is "one hundred thirty-two billion, forty-three million, six hundred forty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •