Base | Representation |
---|---|
bin | 1001101100111010000100… |
… | …00001101101010110000001 |
3 | 2210112112022210112102200112 |
4 | 10312131002001231112001 |
5 | 10244014430314201421 |
6 | 113212444555201105 |
7 | 4331226422335124 |
oct | 466350201552601 |
9 | 83475283472615 |
10 | 21334210303361 |
11 | 688587359750a |
12 | 2486867a46195 |
13 | bb9a65b18917 |
14 | 53a81d0aa3bb |
15 | 26ee4234c45b |
hex | 13674206d581 |
21334210303361 has 2 divisors, whose sum is σ = 21334210303362. Its totient is φ = 21334210303360.
The previous prime is 21334210303309. The next prime is 21334210303433. The reversal of 21334210303361 is 16330301243312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15035440533136 + 6298769770225 = 3877556^2 + 2509735^2 .
It is a cyclic number.
It is not a de Polignac number, because 21334210303361 - 222 = 21334206109057 is a prime.
It is not a weakly prime, because it can be changed into another prime (21334210303561) 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, 10667105151680 + 10667105151681.
It is an arithmetic number, because the mean of its divisors is an integer number (10667105151681).
Almost surely, 221334210303361 is an apocalyptic number.
It is an amenable number.
21334210303361 is a deficient number, since it is larger than the sum of its proper divisors (1).
21334210303361 is an equidigital number, since it uses as much as digits as its factorization.
21334210303361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 32.
Adding to 21334210303361 its reverse (16330301243312), we get a palindrome (37664511546673).
The spelling of 21334210303361 in words is "twenty-one trillion, three hundred thirty-four billion, two hundred ten million, three hundred three thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •