Base | Representation |
---|---|
bin | 1001101011111111111110… |
… | …10000011111010011000001 |
3 | 2210102112211110111211011121 |
4 | 10311333333100133103001 |
5 | 10243012043441132231 |
6 | 113150250313112241 |
7 | 4326043553430355 |
oct | 465777720372301 |
9 | 83375743454147 |
10 | 21303025333441 |
11 | 6873620482aa5 |
12 | 24808040b8681 |
13 | bb6b360c25b7 |
14 | 539101525465 |
15 | 26e2196a6311 |
hex | 135fff41f4c1 |
21303025333441 has 2 divisors, whose sum is σ = 21303025333442. Its totient is φ = 21303025333440.
The previous prime is 21303025333367. The next prime is 21303025333489. The reversal of 21303025333441 is 14433352030312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17181025000000 + 4122000333441 = 4145000^2 + 2030271^2 .
It is a cyclic number.
It is not a de Polignac number, because 21303025333441 - 27 = 21303025333313 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21303025333397 and 21303025333406.
It is not a weakly prime, because it can be changed into another prime (21303025333841) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10651512666720 + 10651512666721.
It is an arithmetic number, because the mean of its divisors is an integer number (10651512666721).
Almost surely, 221303025333441 is an apocalyptic number.
It is an amenable number.
21303025333441 is a deficient number, since it is larger than the sum of its proper divisors (1).
21303025333441 is an equidigital number, since it uses as much as digits as its factorization.
21303025333441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 77760, while the sum is 34.
Adding to 21303025333441 its reverse (14433352030312), we get a palindrome (35736377363753).
The spelling of 21303025333441 in words is "twenty-one trillion, three hundred three billion, twenty-five million, three hundred thirty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •