Base | Representation |
---|---|
bin | 10110101111101010010000… |
… | …111100111101001000001001 |
3 | 111010011222122102100101121211 |
4 | 112233222100330331020021 |
5 | 101102411441334100321 |
6 | 552430100105533121 |
7 | 30033042445412356 |
oct | 2657522074751011 |
9 | 433158572311554 |
10 | 100032220221961 |
11 | 29967476531895 |
12 | b276ab81a41a1 |
13 | 43a7cc849cb41 |
14 | 1a9b82a07d62d |
15 | b871032ac0e1 |
hex | 5afa90f3d209 |
100032220221961 has 2 divisors, whose sum is σ = 100032220221962. Its totient is φ = 100032220221960.
The previous prime is 100032220221917. The next prime is 100032220222009. The reversal of 100032220221961 is 169122022230001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 88243854192400 + 11788366029561 = 9393820^2 + 3433419^2 .
It is a cyclic number.
It is not a de Polignac number, because 100032220221961 - 235 = 99997860483593 is a prime.
It is a super-2 number, since 2×1000322202219612 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100032220221911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50016110110980 + 50016110110981.
It is an arithmetic number, because the mean of its divisors is an integer number (50016110110981).
Almost surely, 2100032220221961 is an apocalyptic number.
It is an amenable number.
100032220221961 is a deficient number, since it is larger than the sum of its proper divisors (1).
100032220221961 is an equidigital number, since it uses as much as digits as its factorization.
100032220221961 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 31.
Adding to 100032220221961 its reverse (169122022230001), we get a palindrome (269154242451962).
The spelling of 100032220221961 in words is "one hundred trillion, thirty-two billion, two hundred twenty million, two hundred twenty-one thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •