Base | Representation |
---|---|
bin | 1100001101011101111001… |
… | …0010000101001110110001 |
3 | 1202112110120022201220001201 |
4 | 3003113132102011032301 |
5 | 3224430412013110334 |
6 | 44315331314531201 |
7 | 2553650312541535 |
oct | 303273622051661 |
9 | 52473508656051 |
10 | 13425502081969 |
11 | 43067a5a1779a |
12 | 1609b51596b01 |
13 | 765033863893 |
14 | 345b25109bc5 |
15 | 184364d7cc14 |
hex | c35de4853b1 |
13425502081969 has 2 divisors, whose sum is σ = 13425502081970. Its totient is φ = 13425502081968.
The previous prime is 13425502081913. The next prime is 13425502081987. The reversal of 13425502081969 is 96918020552431.
13425502081969 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12658937043600 + 766565038369 = 3557940^2 + 875537^2 .
It is a cyclic number.
It is not a de Polignac number, because 13425502081969 - 29 = 13425502081457 is a prime.
It is a super-2 number, since 2×134255020819692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13425502081769) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6712751040984 + 6712751040985.
It is an arithmetic number, because the mean of its divisors is an integer number (6712751040985).
Almost surely, 213425502081969 is an apocalyptic number.
It is an amenable number.
13425502081969 is a deficient number, since it is larger than the sum of its proper divisors (1).
13425502081969 is an equidigital number, since it uses as much as digits as its factorization.
13425502081969 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4665600, while the sum is 55.
The spelling of 13425502081969 in words is "thirteen trillion, four hundred twenty-five billion, five hundred two million, eighty-one thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •