Base | Representation |
---|---|
bin | 11110000010010101110010… |
… | …100000011010100100001001 |
3 | 122022201211221120001112221122 |
4 | 132002111302200122210021 |
5 | 114303330331414114423 |
6 | 1144542532103245025 |
7 | 36553033261602323 |
oct | 3602256240324411 |
9 | 568654846045848 |
10 | 132102230223113 |
11 | 39101272076807 |
12 | 12996369749775 |
13 | 58932576b0027 |
14 | 2489ad3d76613 |
15 | 104143749c8c8 |
hex | 78257281a909 |
132102230223113 has 16 divisors (see below), whose sum is σ = 141486422039424. Its totient is φ = 122902354248960.
The previous prime is 132102230223097. The next prime is 132102230223149. The reversal of 132102230223113 is 311322032201231.
It is a cyclic number.
It is not a de Polignac number, because 132102230223113 - 24 = 132102230223097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132102230253113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 77928845 + ... + 79605962.
It is an arithmetic number, because the mean of its divisors is an integer number (8842901377464).
Almost surely, 2132102230223113 is an apocalyptic number.
It is an amenable number.
132102230223113 is a deficient number, since it is larger than the sum of its proper divisors (9384191816311).
132102230223113 is a wasteful number, since it uses less digits than its factorization.
132102230223113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157535392.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 132102230223113 its reverse (311322032201231), we get a palindrome (443424262424344).
The spelling of 132102230223113 in words is "one hundred thirty-two trillion, one hundred two billion, two hundred thirty million, two hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •