Base | Representation |
---|---|
bin | 11000110001110000… |
… | …00110001110111001 |
3 | 1021100001112212010221 |
4 | 30120320012032321 |
5 | 204220334320130 |
6 | 10035545340041 |
7 | 650433231031 |
oct | 143070061671 |
9 | 37301485127 |
10 | 13302260665 |
11 | 5706863361 |
12 | 26b2a97621 |
13 | 133cbb1775 |
14 | 90296a8c1 |
15 | 52cc5a87a |
hex | 318e063b9 |
13302260665 has 4 divisors (see below), whose sum is σ = 15962712804. Its totient is φ = 10641808528.
The previous prime is 13302260617. The next prime is 13302260687. The reversal of 13302260665 is 56606220331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 56606220331 = 149 ⋅379907519.
It can be written as a sum of positive squares in 2 ways, for example, as 1461991696 + 11840268969 = 38236^2 + 108813^2 .
It is a cyclic number.
It is not a de Polignac number, because 13302260665 - 213 = 13302252473 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13302260665.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1330226062 + ... + 1330226071.
It is an arithmetic number, because the mean of its divisors is an integer number (3990678201).
Almost surely, 213302260665 is an apocalyptic number.
It is an amenable number.
13302260665 is a deficient number, since it is larger than the sum of its proper divisors (2660452139).
13302260665 is an equidigital number, since it uses as much as digits as its factorization.
13302260665 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2660452138.
The product of its (nonzero) digits is 38880, while the sum is 34.
Adding to 13302260665 its reverse (56606220331), we get a palindrome (69908480996).
The spelling of 13302260665 in words is "thirteen billion, three hundred two million, two hundred sixty thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •