Base | Representation |
---|---|
bin | 100000001110001110110… |
… | …000111011110111001101 |
3 | 21211200111121102000022101 |
4 | 200032032300323313031 |
5 | 242234343124201341 |
6 | 4413123101315101 |
7 | 315656333632414 |
oct | 40161660736715 |
9 | 7750447360271 |
10 | 2214303350221 |
11 | 784098572786 |
12 | 2b9191865a91 |
13 | 130a66c94091 |
14 | 7925c45047b |
15 | 3c8ec006831 |
hex | 2038ec3bdcd |
2214303350221 has 2 divisors, whose sum is σ = 2214303350222. Its totient is φ = 2214303350220.
The previous prime is 2214303350107. The next prime is 2214303350243. The reversal of 2214303350221 is 1220533034122.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1577571168196 + 636732182025 = 1256014^2 + 797955^2 .
It is a cyclic number.
It is not a de Polignac number, because 2214303350221 - 215 = 2214303317453 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2214303350221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2214303350251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1107151675110 + 1107151675111.
It is an arithmetic number, because the mean of its divisors is an integer number (1107151675111).
Almost surely, 22214303350221 is an apocalyptic number.
It is an amenable number.
2214303350221 is a deficient number, since it is larger than the sum of its proper divisors (1).
2214303350221 is an equidigital number, since it uses as much as digits as its factorization.
2214303350221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 2214303350221 its reverse (1220533034122), we get a palindrome (3434836384343).
The spelling of 2214303350221 in words is "two trillion, two hundred fourteen billion, three hundred three million, three hundred fifty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •