Base | Representation |
---|---|
bin | 1100000010111010100111… |
… | …1000100001101010011101 |
3 | 1201220010200110111120011121 |
4 | 3000232221320201222131 |
5 | 3213443142442403041 |
6 | 44100152310050541 |
7 | 2534602321265635 |
oct | 300565170415235 |
9 | 51803613446147 |
10 | 13244234341021 |
11 | 4246937011022 |
12 | 159a9a3349a51 |
13 | 750c0639a678 |
14 | 33b04abc96c5 |
15 | 17e7a62077d1 |
hex | c0ba9e21a9d |
13244234341021 has 2 divisors, whose sum is σ = 13244234341022. Its totient is φ = 13244234341020.
The previous prime is 13244234341003. The next prime is 13244234341043. The reversal of 13244234341021 is 12014343244231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12370731012025 + 873503328996 = 3517205^2 + 934614^2 .
It is an emirp because it is prime and its reverse (12014343244231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13244234341021 - 235 = 13209874602653 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13244204341021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6622117170510 + 6622117170511.
It is an arithmetic number, because the mean of its divisors is an integer number (6622117170511).
Almost surely, 213244234341021 is an apocalyptic number.
It is an amenable number.
13244234341021 is a deficient number, since it is larger than the sum of its proper divisors (1).
13244234341021 is an equidigital number, since it uses as much as digits as its factorization.
13244234341021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 55296, while the sum is 34.
Adding to 13244234341021 its reverse (12014343244231), we get a palindrome (25258577585252).
The spelling of 13244234341021 in words is "thirteen trillion, two hundred forty-four billion, two hundred thirty-four million, three hundred forty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.090 sec. • engine limits •