Base | Representation |
---|---|
bin | 1100001110011100110110… |
… | …0000001010110111010001 |
3 | 1202121002011222221222211201 |
4 | 3003213031200022313101 |
5 | 3230220014002302234 |
6 | 44331204205111201 |
7 | 2555116133255104 |
oct | 303471540126721 |
9 | 52532158858751 |
10 | 13442400431569 |
11 | 431298766797a |
12 | 1611288858501 |
13 | 7667c7786205 |
14 | 3468894c873b |
15 | 184a03676314 |
hex | c39cd80add1 |
13442400431569 has 2 divisors, whose sum is σ = 13442400431570. Its totient is φ = 13442400431568.
The previous prime is 13442400431531. The next prime is 13442400431597. The reversal of 13442400431569 is 96513400424431.
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., 11937460333969 + 1504940097600 = 3455063^2 + 1226760^2 .
It is an emirp because it is prime and its reverse (96513400424431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13442400431569 - 27 = 13442400431441 is a prime.
It is a super-2 number, since 2×134424004315692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13442400731569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6721200215784 + 6721200215785.
It is an arithmetic number, because the mean of its divisors is an integer number (6721200215785).
Almost surely, 213442400431569 is an apocalyptic number.
It is an amenable number.
13442400431569 is a deficient number, since it is larger than the sum of its proper divisors (1).
13442400431569 is an equidigital number, since it uses as much as digits as its factorization.
13442400431569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1244160, while the sum is 46.
The spelling of 13442400431569 in words is "thirteen trillion, four hundred forty-two billion, four hundred million, four hundred thirty-one thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •