Base | Representation |
---|---|
bin | 11110000010011111000110… |
… | …000000100110001011100101 |
3 | 122022202210201211122211101102 |
4 | 132002133012000212023211 |
5 | 114304011312100242241 |
6 | 1144551303322405445 |
7 | 36553535665640441 |
oct | 3602370600461345 |
9 | 568683654584342 |
10 | 132112221102821 |
11 | 39105529721593 |
12 | 12998297660885 |
13 | 589418a52617b |
14 | 248a3a0c03821 |
15 | 104181e65839b |
hex | 7827c60262e5 |
132112221102821 has 2 divisors, whose sum is σ = 132112221102822. Its totient is φ = 132112221102820.
The previous prime is 132112221102803. The next prime is 132112221102847. The reversal of 132112221102821 is 128201122211231.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131309001852196 + 803219250625 = 11459014^2 + 896225^2 .
It is a cyclic number.
It is not a de Polignac number, because 132112221102821 - 210 = 132112221101797 is a prime.
It is a super-2 number, since 2×1321122211028212 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132112221101821) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66056110551410 + 66056110551411.
It is an arithmetic number, because the mean of its divisors is an integer number (66056110551411).
Almost surely, 2132112221102821 is an apocalyptic number.
It is an amenable number.
132112221102821 is a deficient number, since it is larger than the sum of its proper divisors (1).
132112221102821 is an equidigital number, since it uses as much as digits as its factorization.
132112221102821 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 29.
The spelling of 132112221102821 in words is "one hundred thirty-two trillion, one hundred twelve billion, two hundred twenty-one million, one hundred two thousand, eight hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.519 sec. • engine limits •