Base | Representation |
---|---|
bin | 101110001011110100011001… |
… | …111111100011101001100101 |
3 | 222122012022020000212202222211 |
4 | 232023310121333203221211 |
5 | 203110424010022434341 |
6 | 2000001035125523421 |
7 | 60533050361100352 |
oct | 5613643177435145 |
9 | 878168200782884 |
10 | 203122324421221 |
11 | 597a276a825217 |
12 | 1a946573573571 |
13 | 894547871bbca |
14 | 382325c84b629 |
15 | 1873a27881181 |
hex | b8bd19fe3a65 |
203122324421221 has 2 divisors, whose sum is σ = 203122324421222. Its totient is φ = 203122324421220.
The previous prime is 203122324421153. The next prime is 203122324421227. The reversal of 203122324421221 is 122124423221302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 202849119585121 + 273204836100 = 14242511^2 + 522690^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-203122324421221 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (203122324421227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101561162210610 + 101561162210611.
It is an arithmetic number, because the mean of its divisors is an integer number (101561162210611).
Almost surely, 2203122324421221 is an apocalyptic number.
It is an amenable number.
203122324421221 is a deficient number, since it is larger than the sum of its proper divisors (1).
203122324421221 is an equidigital number, since it uses as much as digits as its factorization.
203122324421221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 203122324421221 its reverse (122124423221302), we get a palindrome (325246747642523).
The spelling of 203122324421221 in words is "two hundred three trillion, one hundred twenty-two billion, three hundred twenty-four million, four hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •