Base | Representation |
---|---|
bin | 1100111000011111100… |
… | …0001111100100111001 |
3 | 210011021101021022201122 |
4 | 3032013320033210321 |
5 | 12111232142000441 |
6 | 245401355555025 |
7 | 21663406314056 |
oct | 3160770174471 |
9 | 704241238648 |
10 | 221323000121 |
11 | 85954077853 |
12 | 36a8875ba75 |
13 | 17b41b25902 |
14 | a9d7d9402d |
15 | 5b5542534b |
hex | 3387e0f939 |
221323000121 has 2 divisors, whose sum is σ = 221323000122. Its totient is φ = 221323000120.
The previous prime is 221323000111. The next prime is 221323000123. The reversal of 221323000121 is 121000323122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 160649457721 + 60673542400 = 400811^2 + 246320^2 .
It is a cyclic number.
It is not a de Polignac number, because 221323000121 - 210 = 221322999097 is a prime.
Together with 221323000123, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 221323000121.
It is not a weakly prime, because it can be changed into another prime (221323000123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110661500060 + 110661500061.
It is an arithmetic number, because the mean of its divisors is an integer number (110661500061).
Almost surely, 2221323000121 is an apocalyptic number.
It is an amenable number.
221323000121 is a deficient number, since it is larger than the sum of its proper divisors (1).
221323000121 is an equidigital number, since it uses as much as digits as its factorization.
221323000121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 221323000121 its reverse (121000323122), we get a palindrome (342323323243).
The spelling of 221323000121 in words is "two hundred twenty-one billion, three hundred twenty-three million, one hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •