Base | Representation |
---|---|
bin | 11110000011111110010110… |
… | …111011101100011010111101 |
3 | 122100010120202120012210010001 |
4 | 132003332112323230122331 |
5 | 114312200304142103423 |
6 | 1145110301351314301 |
7 | 36564116552334016 |
oct | 3603762673543275 |
9 | 570116676183101 |
10 | 132214510503613 |
11 | 3914494a39935a |
12 | 129b408407b991 |
13 | 58a0a0c439525 |
14 | 2491305d3400d |
15 | 104430986dcad |
hex | 783f96eec6bd |
132214510503613 has 8 divisors (see below), whose sum is σ = 134722474417440. Its totient is φ = 129722270502000.
The previous prime is 132214510503601. The next prime is 132214510503629. The reversal of 132214510503613 is 316305015412231.
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-132214510503613 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132214510503113) 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, 3930961078 + ... + 3930994711.
It is an arithmetic number, because the mean of its divisors is an integer number (16840309302180).
Almost surely, 2132214510503613 is an apocalyptic number.
It is an amenable number.
132214510503613 is a deficient number, since it is larger than the sum of its proper divisors (2507963913827).
132214510503613 is an equidigital number, since it uses as much as digits as its factorization.
132214510503613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7861956107.
The product of its (nonzero) digits is 64800, while the sum is 37.
Adding to 132214510503613 its reverse (316305015412231), we get a palindrome (448519525915844).
The spelling of 132214510503613 in words is "one hundred thirty-two trillion, two hundred fourteen billion, five hundred ten million, five hundred three thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •