Base | Representation |
---|---|
bin | 1100100000111110011… |
… | …0000101010011001101 |
3 | 202112222102021000010202 |
4 | 3020033212011103031 |
5 | 12010320030144341 |
6 | 242435122343245 |
7 | 21351101620043 |
oct | 3101746052315 |
9 | 675872230122 |
10 | 215010006221 |
11 | 832045a801a |
12 | 358064bab25 |
13 | 17376c5c86a |
14 | a59978c393 |
15 | 58d60b379b |
hex | 320f9854cd |
215010006221 has 2 divisors, whose sum is σ = 215010006222. Its totient is φ = 215010006220.
The previous prime is 215010006179. The next prime is 215010006241. The reversal of 215010006221 is 122600010512.
It is an a-pointer prime, because the next prime (215010006241) can be obtained adding 215010006221 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 215008416100 + 1590121 = 463690^2 + 1261^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-215010006221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 215010006193 and 215010006202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (215010006241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 107505003110 + 107505003111.
It is an arithmetic number, because the mean of its divisors is an integer number (107505003111).
Almost surely, 2215010006221 is an apocalyptic number.
It is an amenable number.
215010006221 is a deficient number, since it is larger than the sum of its proper divisors (1).
215010006221 is an equidigital number, since it uses as much as digits as its factorization.
215010006221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 215010006221 its reverse (122600010512), we get a palindrome (337610016733).
The spelling of 215010006221 in words is "two hundred fifteen billion, ten million, six thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •