Base | Representation |
---|---|
bin | 101101110000001001110110… |
… | …110011001000110110010001 |
3 | 222101110120010011110021212221 |
4 | 231300021312303020312101 |
5 | 202333302014444402143 |
6 | 1551543425334021041 |
7 | 60245516122064326 |
oct | 5560116663106621 |
9 | 871416104407787 |
10 | 201221210934673 |
11 | 5912a488823616 |
12 | 1a69a0284a7781 |
13 | 88381040a3ab7 |
14 | 37992311acb4d |
15 | 183e35ae912ed |
hex | b70276cc8d91 |
201221210934673 has 2 divisors, whose sum is σ = 201221210934674. Its totient is φ = 201221210934672.
The previous prime is 201221210934659. The next prime is 201221210934739. The reversal of 201221210934673 is 376439012122102.
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., 112631269132944 + 88589941801729 = 10612788^2 + 9412223^2 .
It is a cyclic number.
It is not a de Polignac number, because 201221210934673 - 225 = 201221177380241 is a prime.
It is not a weakly prime, because it can be changed into another prime (201221210904673) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100610605467336 + 100610605467337.
It is an arithmetic number, because the mean of its divisors is an integer number (100610605467337).
Almost surely, 2201221210934673 is an apocalyptic number.
It is an amenable number.
201221210934673 is a deficient number, since it is larger than the sum of its proper divisors (1).
201221210934673 is an equidigital number, since it uses as much as digits as its factorization.
201221210934673 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 217728, while the sum is 43.
The spelling of 201221210934673 in words is "two hundred one trillion, two hundred twenty-one billion, two hundred ten million, nine hundred thirty-four thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •