Base | Representation |
---|---|
bin | 1001110101010000101010… |
… | …11000000110001100101001 |
3 | 2211112222011021110020001122 |
4 | 10322220111120012030221 |
5 | 10313220231321201231 |
6 | 113552353031025025 |
7 | 4361040041504513 |
oct | 472502530061451 |
9 | 84488137406048 |
10 | 21621224006441 |
11 | 6986567318714 |
12 | 251240820b175 |
13 | c0ab46362a67 |
14 | 54a68960cbb3 |
15 | 27763e8b477b |
hex | 13aa15606329 |
21621224006441 has 2 divisors, whose sum is σ = 21621224006442. Its totient is φ = 21621224006440.
The previous prime is 21621224006419. The next prime is 21621224006443. The reversal of 21621224006441 is 14460042212612.
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., 15485799040000 + 6135424966441 = 3935200^2 + 2476979^2 .
It is a cyclic number.
It is not a de Polignac number, because 21621224006441 - 238 = 21346346099497 is a prime.
Together with 21621224006443, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (21621224006443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10810612003220 + 10810612003221.
It is an arithmetic number, because the mean of its divisors is an integer number (10810612003221).
Almost surely, 221621224006441 is an apocalyptic number.
It is an amenable number.
21621224006441 is a deficient number, since it is larger than the sum of its proper divisors (1).
21621224006441 is an equidigital number, since it uses as much as digits as its factorization.
21621224006441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36864, while the sum is 35.
The spelling of 21621224006441 in words is "twenty-one trillion, six hundred twenty-one billion, two hundred twenty-four million, six thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •