Base | Representation |
---|---|
bin | 11110000000111000101111… |
… | …100100101011110110100111 |
3 | 122022101022001212000211202222 |
4 | 132000320233210223312213 |
5 | 114300211224143134343 |
6 | 1144425010253222555 |
7 | 36542565422442254 |
oct | 3600705744536647 |
9 | 568338055024688 |
10 | 132002323021223 |
11 | 39072964063266 |
12 | 1297ab26a91a5b |
13 | 58869c5192015 |
14 | 2484d3739042b |
15 | 103da3b493a68 |
hex | 780e2f92bda7 |
132002323021223 has 2 divisors, whose sum is σ = 132002323021224. Its totient is φ = 132002323021222.
The previous prime is 132002323021201. The next prime is 132002323021229. The reversal of 132002323021223 is 322120323200231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 132002323021223 - 210 = 132002323020199 is a prime.
It is a super-2 number, since 2×1320023230212232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132002323021192 and 132002323021201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132002323021229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66001161510611 + 66001161510612.
It is an arithmetic number, because the mean of its divisors is an integer number (66001161510612).
Almost surely, 2132002323021223 is an apocalyptic number.
132002323021223 is a deficient number, since it is larger than the sum of its proper divisors (1).
132002323021223 is an equidigital number, since it uses as much as digits as its factorization.
132002323021223 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 132002323021223 its reverse (322120323200231), we get a palindrome (454122646221454).
The spelling of 132002323021223 in words is "one hundred thirty-two trillion, two billion, three hundred twenty-three million, twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •