Base | Representation |
---|---|
bin | 1100000111010101101001… |
… | …0111000011000001110101 |
3 | 1202011101210022022101120101 |
4 | 3001311122113003001311 |
5 | 3221214242122413203 |
6 | 44155115251034101 |
7 | 2543232132160612 |
oct | 301653227030165 |
9 | 52141708271511 |
10 | 13320209576053 |
11 | 4276084059666 |
12 | 15b166729b931 |
13 | 75812371c843 |
14 | 3409b7205509 |
15 | 1817511ad41d |
hex | c1d5a5c3075 |
13320209576053 has 2 divisors, whose sum is σ = 13320209576054. Its totient is φ = 13320209576052.
The previous prime is 13320209575987. The next prime is 13320209576057. The reversal of 13320209576053 is 35067590202331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11473279651729 + 1846929924324 = 3387223^2 + 1359018^2 .
It is a cyclic number.
It is not a de Polignac number, because 13320209576053 - 233 = 13311619641461 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13320209575994 and 13320209576012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13320209576057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660104788026 + 6660104788027.
It is an arithmetic number, because the mean of its divisors is an integer number (6660104788027).
Almost surely, 213320209576053 is an apocalyptic number.
It is an amenable number.
13320209576053 is a deficient number, since it is larger than the sum of its proper divisors (1).
13320209576053 is an equidigital number, since it uses as much as digits as its factorization.
13320209576053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1020600, while the sum is 46.
Adding to 13320209576053 its reverse (35067590202331), we get a palindrome (48387799778384).
The spelling of 13320209576053 in words is "thirteen trillion, three hundred twenty billion, two hundred nine million, five hundred seventy-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •