Base | Representation |
---|---|
bin | 11000101010110110… |
… | …01010010001101001 |
3 | 1021012000120100121002 |
4 | 30111123022101221 |
5 | 204111022442101 |
6 | 10030120124345 |
7 | 646131030032 |
oct | 142533122151 |
9 | 37160510532 |
10 | 13244343401 |
11 | 56870a5253 |
12 | 26976066b5 |
13 | 1330bb37b3 |
14 | 8d8db1a89 |
15 | 527b19d6b |
hex | 3156ca469 |
13244343401 has 2 divisors, whose sum is σ = 13244343402. Its totient is φ = 13244343400.
The previous prime is 13244343367. The next prime is 13244343403. The reversal of 13244343401 is 10434344231.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8281000000 + 4963343401 = 91000^2 + 70451^2 .
It is an emirp because it is prime and its reverse (10434344231) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13244343401 is a prime.
It is a super-2 number, since 2×132443434012 (a number of 21 digits) contains 22 as substring.
Together with 13244343403, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (13244343403) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6622171700 + 6622171701.
It is an arithmetic number, because the mean of its divisors is an integer number (6622171701).
Almost surely, 213244343401 is an apocalyptic number.
It is an amenable number.
13244343401 is a deficient number, since it is larger than the sum of its proper divisors (1).
13244343401 is an equidigital number, since it uses as much as digits as its factorization.
13244343401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 13244343401 its reverse (10434344231), we get a palindrome (23678687632).
The spelling of 13244343401 in words is "thirteen billion, two hundred forty-four million, three hundred forty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •