Base | Representation |
---|---|
bin | 11110000010110011101100… |
… | …100110100101010000111111 |
3 | 122022211220211120201112220002 |
4 | 132002303230212211100333 |
5 | 114304342113404244411 |
6 | 1145005402424544515 |
7 | 36555251131425641 |
oct | 3602635446452077 |
9 | 568756746645802 |
10 | 132134343431231 |
11 | 3911395114a329 |
12 | 129a063032213b |
13 | 58962a4808b1b |
14 | 248b49cd08891 |
15 | 10421b689c33b |
hex | 782cec9a543f |
132134343431231 has 8 divisors (see below), whose sum is σ = 136740310237824. Its totient is φ = 127549849664160.
The previous prime is 132134343431197. The next prime is 132134343431239.
132134343431231 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132134343431231 is a prime.
It is a super-2 number, since 2×1321343434312312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132134343431239) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5368247360 + ... + 5368271973.
It is an arithmetic number, because the mean of its divisors is an integer number (17092538779728).
Almost surely, 2132134343431231 is an apocalyptic number.
132134343431231 is a deficient number, since it is larger than the sum of its proper divisors (4605966806593).
132134343431231 is a wasteful number, since it uses less digits than its factorization.
132134343431231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10736519761.
The product of its digits is 186624, while the sum is 38.
The spelling of 132134343431231 in words is "one hundred thirty-two trillion, one hundred thirty-four billion, three hundred forty-three million, four hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •