Base | Representation |
---|---|
bin | 11000110100010101… |
… | …00110110110000101 |
3 | 1021101120020202002101 |
4 | 30122022212312011 |
5 | 204241403440203 |
6 | 10042041112101 |
7 | 651115124335 |
oct | 143212466605 |
9 | 37346222071 |
10 | 13323890053 |
11 | 5717a96891 |
12 | 26ba188631 |
13 | 1344515716 |
14 | 90579b0c5 |
15 | 52eace41d |
hex | 31a2a6d85 |
13323890053 has 2 divisors, whose sum is σ = 13323890054. Its totient is φ = 13323890052.
The previous prime is 13323890051. The next prime is 13323890093. The reversal of 13323890053 is 35009832331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6694185124 + 6629704929 = 81818^2 + 81423^2 .
It is an emirp because it is prime and its reverse (35009832331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13323890053 - 21 = 13323890051 is a prime.
It is a super-2 number, since 2×133238900532 (a number of 21 digits) contains 22 as substring.
Together with 13323890051, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 13323889994 and 13323890021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13323890051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6661945026 + 6661945027.
It is an arithmetic number, because the mean of its divisors is an integer number (6661945027).
Almost surely, 213323890053 is an apocalyptic number.
It is an amenable number.
13323890053 is a deficient number, since it is larger than the sum of its proper divisors (1).
13323890053 is an equidigital number, since it uses as much as digits as its factorization.
13323890053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 58320, while the sum is 37.
The spelling of 13323890053 in words is "thirteen billion, three hundred twenty-three million, eight hundred ninety thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •