Base | Representation |
---|---|
bin | 1100011001001010010100… |
… | …0111011011111101001101 |
3 | 1210020200010200202101111001 |
4 | 3012102211013123331031 |
5 | 3241223340022444234 |
6 | 44551515032500301 |
7 | 2604322024531144 |
oct | 306224507337515 |
9 | 53220120671431 |
10 | 13626406453069 |
11 | 4383a21226323 |
12 | 1640a7bb4a691 |
13 | 77ac70349b87 |
14 | 35174336475b |
15 | 1896c28e3d14 |
hex | c64a51dbf4d |
13626406453069 has 2 divisors, whose sum is σ = 13626406453070. Its totient is φ = 13626406453068.
The previous prime is 13626406453031. The next prime is 13626406453087. The reversal of 13626406453069 is 96035460462631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6911441197444 + 6714965255625 = 2628962^2 + 2591325^2 .
It is an emirp because it is prime and its reverse (96035460462631) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13626406453069 - 213 = 13626406444877 is a prime.
It is a super-2 number, since 2×136264064530692 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13626406453369) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6813203226534 + 6813203226535.
It is an arithmetic number, because the mean of its divisors is an integer number (6813203226535).
Almost surely, 213626406453069 is an apocalyptic number.
It is an amenable number.
13626406453069 is a deficient number, since it is larger than the sum of its proper divisors (1).
13626406453069 is an equidigital number, since it uses as much as digits as its factorization.
13626406453069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16796160, while the sum is 55.
The spelling of 13626406453069 in words is "thirteen trillion, six hundred twenty-six billion, four hundred six million, four hundred fifty-three thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •