Base | Representation |
---|---|
bin | 1110101001011101101110… |
… | …01000100100100010000101 |
3 | 11020001100022012220122110111 |
4 | 13110232313020210202011 |
5 | 13210221143222330041 |
6 | 152301313253153021 |
7 | 6533112256301221 |
oct | 724566710444205 |
9 | 136040265818414 |
10 | 32211032230021 |
11 | a299692a54807 |
12 | 374286962b771 |
13 | 14c86447c3138 |
14 | 7d50451bb781 |
15 | 3acd39a34981 |
hex | 1d4bb7224885 |
32211032230021 has 2 divisors, whose sum is σ = 32211032230022. Its totient is φ = 32211032230020.
The previous prime is 32211032230001. The next prime is 32211032230031. The reversal of 32211032230021 is 12003223011223.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 24781618996996 + 7429413233025 = 4978114^2 + 2725695^2 .
It is a cyclic number.
It is not a de Polignac number, because 32211032230021 - 219 = 32211031705733 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32211032229974 and 32211032230001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32211032230001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16105516115010 + 16105516115011.
It is an arithmetic number, because the mean of its divisors is an integer number (16105516115011).
Almost surely, 232211032230021 is an apocalyptic number.
It is an amenable number.
32211032230021 is a deficient number, since it is larger than the sum of its proper divisors (1).
32211032230021 is an equidigital number, since it uses as much as digits as its factorization.
32211032230021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 32211032230021 its reverse (12003223011223), we get a palindrome (44214255241244).
The spelling of 32211032230021 in words is "thirty-two trillion, two hundred eleven billion, thirty-two million, two hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •