Base | Representation |
---|---|
bin | 11000110011111111… |
… | …00101110010000001 |
3 | 1021101100211000120122 |
4 | 30121333211302001 |
5 | 204240134031423 |
6 | 10041455150025 |
7 | 651051435566 |
oct | 143177456201 |
9 | 37340730518 |
10 | 13321002113 |
11 | 57163a4061 |
12 | 26b9215315 |
13 | 1343a44093 |
14 | 90524886d |
15 | 52e70d8c8 |
hex | 319fe5c81 |
13321002113 has 4 divisors (see below), whose sum is σ = 13503481668. Its totient is φ = 13138522560.
The previous prime is 13321002089. The next prime is 13321002181. The reversal of 13321002113 is 31120012331.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3008193409 + 10312808704 = 54847^2 + 101552^2 .
It is a cyclic number.
It is not a de Polignac number, because 13321002113 - 232 = 9026034817 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13321002091 and 13321002100.
It is not an unprimeable number, because it can be changed into a prime (13321002193) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 91239668 + ... + 91239813.
It is an arithmetic number, because the mean of its divisors is an integer number (3375870417).
Almost surely, 213321002113 is an apocalyptic number.
It is an amenable number.
13321002113 is a deficient number, since it is larger than the sum of its proper divisors (182479555).
13321002113 is an equidigital number, since it uses as much as digits as its factorization.
13321002113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 182479554.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 13321002113 its reverse (31120012331), we get a palindrome (44441014444).
The spelling of 13321002113 in words is "thirteen billion, three hundred twenty-one million, two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •