Base | Representation |
---|---|
bin | 11110000101011000011100… |
… | …100101100000000011001111 |
3 | 122100110211102221210200122010 |
4 | 132011120130211200003033 |
5 | 114320241410440110411 |
6 | 1145222540121352303 |
7 | 36604112631421416 |
oct | 3605303445400317 |
9 | 570424387720563 |
10 | 132311242113231 |
11 | 3918197890a385 |
12 | 12a0a97b338693 |
13 | 58a9b86a8345c |
14 | 2495c80c8647d |
15 | 1046abbb9b7a6 |
hex | 78561c9600cf |
132311242113231 has 4 divisors (see below), whose sum is σ = 176414989484312. Its totient is φ = 88207494742152.
The previous prime is 132311242113229. The next prime is 132311242113283.
132311242113231 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 132311242113231 - 21 = 132311242113229 is a prime.
It is a super-3 number, since 3×1323112421132313 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132311242183231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22051873685536 + ... + 22051873685541.
It is an arithmetic number, because the mean of its divisors is an integer number (44103747371078).
Almost surely, 2132311242113231 is an apocalyptic number.
132311242113231 is a deficient number, since it is larger than the sum of its proper divisors (44103747371081).
132311242113231 is an equidigital number, since it uses as much as digits as its factorization.
132311242113231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44103747371080.
The product of its digits is 5184, while the sum is 30.
The spelling of 132311242113231 in words is "one hundred thirty-two trillion, three hundred eleven billion, two hundred forty-two million, one hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •