Base | Representation |
---|---|
bin | 1100011011101001001100… |
… | …0011010011011000111101 |
3 | 1210101202012210212002211211 |
4 | 3012322103003103120331 |
5 | 3242423210040134402 |
6 | 45023250513244421 |
7 | 2610361606615204 |
oct | 306722303233075 |
9 | 53352183762754 |
10 | 13669053052477 |
11 | 43a00161076a9 |
12 | 16491a2263711 |
13 | 781ca8809994 |
14 | 35382b22423b |
15 | 18a86b9134d7 |
hex | c6e930d363d |
13669053052477 has 2 divisors, whose sum is σ = 13669053052478. Its totient is φ = 13669053052476.
The previous prime is 13669053052469. The next prime is 13669053052537. The reversal of 13669053052477 is 77425035096631.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11841781733721 + 1827271318756 = 3441189^2 + 1351766^2 .
It is a cyclic number.
It is not a de Polignac number, because 13669053052477 - 23 = 13669053052469 is a prime.
It is a super-2 number, since 2×136690530524772 (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 (13669054052477) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6834526526238 + 6834526526239.
It is an arithmetic number, because the mean of its divisors is an integer number (6834526526239).
Almost surely, 213669053052477 is an apocalyptic number.
It is an amenable number.
13669053052477 is a deficient number, since it is larger than the sum of its proper divisors (1).
13669053052477 is an equidigital number, since it uses as much as digits as its factorization.
13669053052477 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28576800, while the sum is 58.
The spelling of 13669053052477 in words is "thirteen trillion, six hundred sixty-nine billion, fifty-three million, fifty-two thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.083 sec. • engine limits •