Base | Representation |
---|---|
bin | 1100000111011001110010… |
… | …0011000111011011010001 |
3 | 1202011111122200211121022101 |
4 | 3001312130203013123101 |
5 | 3221224030412123144 |
6 | 44155421400040401 |
7 | 2543301505010404 |
oct | 301663443073321 |
9 | 52144580747271 |
10 | 13321320036049 |
11 | 42765a39686a3 |
12 | 15b1917163101 |
13 | 75826c7c356c |
14 | 340a808a7d3b |
15 | 1817b890d6d4 |
hex | c1d9c8c76d1 |
13321320036049 has 2 divisors, whose sum is σ = 13321320036050. Its totient is φ = 13321320036048.
The previous prime is 13321320036001. The next prime is 13321320036061. The reversal of 13321320036049 is 94063002312331.
13321320036049 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., 11856094519824 + 1465225516225 = 3443268^2 + 1210465^2 .
It is a cyclic number.
It is not a de Polignac number, because 13321320036049 - 27 = 13321320035921 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13321320035999 and 13321320036017.
It is not a weakly prime, because it can be changed into another prime (13321320036449) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660660018024 + 6660660018025.
It is an arithmetic number, because the mean of its divisors is an integer number (6660660018025).
Almost surely, 213321320036049 is an apocalyptic number.
It is an amenable number.
13321320036049 is a deficient number, since it is larger than the sum of its proper divisors (1).
13321320036049 is an equidigital number, since it uses as much as digits as its factorization.
13321320036049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 69984, while the sum is 37.
The spelling of 13321320036049 in words is "thirteen trillion, three hundred twenty-one billion, three hundred twenty million, thirty-six thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •