Base | Representation |
---|---|
bin | 1100111000100001011… |
… | …1100101011010111101 |
3 | 210011021221201201212201 |
4 | 3032020113211122331 |
5 | 12111241242403221 |
6 | 245402252031501 |
7 | 21663536203204 |
oct | 3161027453275 |
9 | 704257651781 |
10 | 221331216061 |
11 | 8595877958a |
12 | 36a8b462591 |
13 | 17b43741407 |
14 | a9d90d223b |
15 | 5b55ee9891 |
hex | 33885e56bd |
221331216061 has 2 divisors, whose sum is σ = 221331216062. Its totient is φ = 221331216060.
The previous prime is 221331216059. The next prime is 221331216089. The reversal of 221331216061 is 160612133122.
It is an a-pointer prime, because the next prime (221331216089) can be obtained adding 221331216061 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 123468607161 + 97862608900 = 351381^2 + 312830^2 .
It is a cyclic number.
It is not a de Polignac number, because 221331216061 - 21 = 221331216059 is a prime.
Together with 221331216059, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221331214061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110665608030 + 110665608031.
It is an arithmetic number, because the mean of its divisors is an integer number (110665608031).
Almost surely, 2221331216061 is an apocalyptic number.
It is an amenable number.
221331216061 is a deficient number, since it is larger than the sum of its proper divisors (1).
221331216061 is an equidigital number, since it uses as much as digits as its factorization.
221331216061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 28.
Adding to 221331216061 its reverse (160612133122), we get a palindrome (381943349183).
The spelling of 221331216061 in words is "two hundred twenty-one billion, three hundred thirty-one million, two hundred sixteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •