Base | Representation |
---|---|
bin | 1001101001011010010001… |
… | …10001001011001010100001 |
3 | 2210010001012121200100220112 |
4 | 10310231020301023022201 |
5 | 10240032400431402111 |
6 | 113041335010021105 |
7 | 4316444201353502 |
oct | 464551061131241 |
9 | 83101177610815 |
10 | 21214064325281 |
11 | 683991a297953 |
12 | 2467517277795 |
13 | bab6296101b9 |
14 | 534aa2604ba9 |
15 | 26bc5e65de8b |
hex | 134b48c4b2a1 |
21214064325281 has 2 divisors, whose sum is σ = 21214064325282. Its totient is φ = 21214064325280.
The previous prime is 21214064325221. The next prime is 21214064325323. The reversal of 21214064325281 is 18252346041212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12104895265681 + 9109169059600 = 3479209^2 + 3018140^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21214064325281 is a prime.
It is a super-2 number, since 2×212140643252812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21214064325221) 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, 10607032162640 + 10607032162641.
It is an arithmetic number, because the mean of its divisors is an integer number (10607032162641).
Almost surely, 221214064325281 is an apocalyptic number.
It is an amenable number.
21214064325281 is a deficient number, since it is larger than the sum of its proper divisors (1).
21214064325281 is an equidigital number, since it uses as much as digits as its factorization.
21214064325281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 184320, while the sum is 41.
The spelling of 21214064325281 in words is "twenty-one trillion, two hundred fourteen billion, sixty-four million, three hundred twenty-five thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •