Base | Representation |
---|---|
bin | 1001100111000101100110… |
… | …01000000111000110001001 |
3 | 2202211102011211022012102222 |
4 | 10303202303020013012021 |
5 | 10232230413023003301 |
6 | 112540534322503425 |
7 | 4310620163616422 |
oct | 463426310070611 |
9 | 82742154265388 |
10 | 21134244344201 |
11 | 6808a89a6673a |
12 | 2453b5b804b75 |
13 | ba3c48887a71 |
14 | 530c8d72a649 |
15 | 269b3bd9e31b |
hex | 1338b3207189 |
21134244344201 has 2 divisors, whose sum is σ = 21134244344202. Its totient is φ = 21134244344200.
The previous prime is 21134244344149. The next prime is 21134244344359. The reversal of 21134244344201 is 10244344243112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13669879398400 + 7464364945801 = 3697280^2 + 2732099^2 .
It is a cyclic number.
It is not a de Polignac number, because 21134244344201 - 26 = 21134244344137 is a prime.
It is not a weakly prime, because it can be changed into another prime (21134244340201) 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, 10567122172100 + 10567122172101.
It is an arithmetic number, because the mean of its divisors is an integer number (10567122172101).
Almost surely, 221134244344201 is an apocalyptic number.
It is an amenable number.
21134244344201 is a deficient number, since it is larger than the sum of its proper divisors (1).
21134244344201 is an equidigital number, since it uses as much as digits as its factorization.
21134244344201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 73728, while the sum is 35.
Adding to 21134244344201 its reverse (10244344243112), we get a palindrome (31378588587313).
The spelling of 21134244344201 in words is "twenty-one trillion, one hundred thirty-four billion, two hundred forty-four million, three hundred forty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •