Base | Representation |
---|---|
bin | 101111110011000111100100… |
… | …000001111000101011000001 |
3 | 1000120022221010221100122022222 |
4 | 233303013210001320223001 |
5 | 210023230102000032431 |
6 | 2023034105535340425 |
7 | 62164652232003344 |
oct | 5763074401705301 |
9 | 1016287127318288 |
10 | 210221000002241 |
11 | 60a8a253062018 |
12 | 1b6b22a3681715 |
13 | 903b9a834c3a7 |
14 | 39caa71c6845b |
15 | 19484e5da457b |
hex | bf31e4078ac1 |
210221000002241 has 2 divisors, whose sum is σ = 210221000002242. Its totient is φ = 210221000002240.
The previous prime is 210221000002193. The next prime is 210221000002261. The reversal of 210221000002241 is 142200000122012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 193963000243600 + 16257999758641 = 13927060^2 + 4032121^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210221000002241 is a prime.
It is not a weakly prime, because it can be changed into another prime (210221000002261) 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, 105110500001120 + 105110500001121.
It is an arithmetic number, because the mean of its divisors is an integer number (105110500001121).
Almost surely, 2210221000002241 is an apocalyptic number.
It is an amenable number.
210221000002241 is a deficient number, since it is larger than the sum of its proper divisors (1).
210221000002241 is an equidigital number, since it uses as much as digits as its factorization.
210221000002241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 210221000002241 its reverse (142200000122012), we get a palindrome (352421000124253).
The spelling of 210221000002241 in words is "two hundred ten trillion, two hundred twenty-one billion, two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •