Base | Representation |
---|---|
bin | 11110000101011000011010… |
… | …000101001111101100110111 |
3 | 122100110211100000202100201220 |
4 | 132011120122011033230313 |
5 | 114320241314211300343 |
6 | 1145222532021121423 |
7 | 36604111611352311 |
oct | 3605303205175467 |
9 | 570424300670656 |
10 | 132311200103223 |
11 | 39181957126669 |
12 | 12a0a969259273 |
13 | 58a9b7b164a6b |
14 | 2495c7946c7b1 |
15 | 1046ab814e183 |
hex | 78561a14fb37 |
132311200103223 has 8 divisors (see below), whose sum is σ = 177065911086336. Its totient is φ = 87881977927800.
The previous prime is 132311200103171. The next prime is 132311200103237. The reversal of 132311200103223 is 322301002113231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132311200103223 - 217 = 132311199972151 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132311200103193 and 132311200103202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132311200103323) 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, 81372200973 + ... + 81372202598.
It is an arithmetic number, because the mean of its divisors is an integer number (22133238885792).
Almost surely, 2132311200103223 is an apocalyptic number.
132311200103223 is a deficient number, since it is larger than the sum of its proper divisors (44754710983113).
132311200103223 is a wasteful number, since it uses less digits than its factorization.
132311200103223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162744403845.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 132311200103223 its reverse (322301002113231), we get a palindrome (454612202216454).
The spelling of 132311200103223 in words is "one hundred thirty-two trillion, three hundred eleven billion, two hundred million, one hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •