Base | Representation |
---|---|
bin | 1001101010100010101010… |
… | …10011110000010111111001 |
3 | 2210020202112012012212221022 |
4 | 10311101111103300113321 |
5 | 10241201444413012331 |
6 | 113111243323552225 |
7 | 4322321255264024 |
oct | 465212523602771 |
9 | 83222465185838 |
10 | 21252929422841 |
11 | 6854353661996 |
12 | 2472b6308b675 |
13 | bb21b151154c |
14 | 53690c18a1bb |
15 | 26cc866b867b |
hex | 1354554f05f9 |
21252929422841 has 2 divisors, whose sum is σ = 21252929422842. Its totient is φ = 21252929422840.
The previous prime is 21252929422717. The next prime is 21252929422853. The reversal of 21252929422841 is 14822492925212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21136279851241 + 116649571600 = 4597421^2 + 341540^2 .
It is a cyclic number.
It is not a de Polignac number, because 21252929422841 - 210 = 21252929421817 is a prime.
It is a super-2 number, since 2×212529294228412 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21252929422861) 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, 10626464711420 + 10626464711421.
It is an arithmetic number, because the mean of its divisors is an integer number (10626464711421).
Almost surely, 221252929422841 is an apocalyptic number.
It is an amenable number.
21252929422841 is a deficient number, since it is larger than the sum of its proper divisors (1).
21252929422841 is an equidigital number, since it uses as much as digits as its factorization.
21252929422841 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3317760, while the sum is 53.
The spelling of 21252929422841 in words is "twenty-one trillion, two hundred fifty-two billion, nine hundred twenty-nine million, four hundred twenty-two thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •