Base | Representation |
---|---|
bin | 11000001111010011… |
… | …00011101110110101 |
3 | 1020120220200220202012 |
4 | 30013221203232311 |
5 | 203122342033121 |
6 | 5551142454005 |
7 | 640323454325 |
oct | 140751435665 |
9 | 36526626665 |
10 | 13013236661 |
11 | 55786a6347 |
12 | 2632134305 |
13 | 12c5057849 |
14 | 8b6413285 |
15 | 5126b8c5b |
hex | 307a63bb5 |
13013236661 has 4 divisors (see below), whose sum is σ = 13057650732. Its totient is φ = 12968822592.
The previous prime is 13013236657. The next prime is 13013236679. The reversal of 13013236661 is 16663231031.
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 11863348561 + 1149888100 = 108919^2 + 33910^2 .
It is a cyclic number.
It is not a de Polignac number, because 13013236661 - 22 = 13013236657 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13013266661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22206596 + ... + 22207181.
It is an arithmetic number, because the mean of its divisors is an integer number (3264412683).
Almost surely, 213013236661 is an apocalyptic number.
It is an amenable number.
13013236661 is a deficient number, since it is larger than the sum of its proper divisors (44414071).
13013236661 is an equidigital number, since it uses as much as digits as its factorization.
13013236661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44414070.
The product of its (nonzero) digits is 11664, while the sum is 32.
Adding to 13013236661 its reverse (16663231031), we get a palindrome (29676467692).
The spelling of 13013236661 in words is "thirteen billion, thirteen million, two hundred thirty-six thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •