Base | Representation |
---|---|
bin | 1100000111101000100000… |
… | …0010011010100000110001 |
3 | 1202011212212001001121011222 |
4 | 3001322020002122200301 |
5 | 3221310123321331244 |
6 | 44201313412314425 |
7 | 2543501430460604 |
oct | 301721002324061 |
9 | 52155761047158 |
10 | 13325270886449 |
11 | 4278241032015 |
12 | 15b263a312a15 |
13 | 75874c196972 |
14 | 340d374a633b |
15 | 18194a6c5bee |
hex | c1e8809a831 |
13325270886449 has 2 divisors, whose sum is σ = 13325270886450. Its totient is φ = 13325270886448.
The previous prime is 13325270886409. The next prime is 13325270886479. The reversal of 13325270886449 is 94468807252331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9718538146849 + 3606732739600 = 3117457^2 + 1899140^2 .
It is a cyclic number.
It is not a de Polignac number, because 13325270886449 - 212 = 13325270882353 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13325270886391 and 13325270886400.
It is not a weakly prime, because it can be changed into another prime (13325270886409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6662635443224 + 6662635443225.
It is an arithmetic number, because the mean of its divisors is an integer number (6662635443225).
It is a 1-persistent number, because it is pandigital, but 2⋅13325270886449 = 26650541772898 is not.
Almost surely, 213325270886449 is an apocalyptic number.
It is an amenable number.
13325270886449 is a deficient number, since it is larger than the sum of its proper divisors (1).
13325270886449 is an equidigital number, since it uses as much as digits as its factorization.
13325270886449 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 69672960, while the sum is 62.
The spelling of 13325270886449 in words is "thirteen trillion, three hundred twenty-five billion, two hundred seventy million, eight hundred eighty-six thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •