Base | Representation |
---|---|
bin | 11000101001100000… |
… | …10100100010000101 |
3 | 1021011020102210200111 |
4 | 30110300110202011 |
5 | 204100134110341 |
6 | 10025035313021 |
7 | 645633415006 |
oct | 142460244205 |
9 | 37136383614 |
10 | 13233113221 |
11 | 5680824909 |
12 | 26938ab771 |
13 | 132b781013 |
14 | 8d76cb1ad |
15 | 526b4c681 |
hex | 314c14885 |
13233113221 has 8 divisors (see below), whose sum is σ = 13733173080. Its totient is φ = 12735969792.
The previous prime is 13233113209. The next prime is 13233113239. The reversal of 13233113221 is 12231133231.
It can be written as a sum of positive squares in 4 ways, for example, as 2184160225 + 11048952996 = 46735^2 + 105114^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13233113221 - 27 = 13233113093 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13233113192 and 13233113201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13233113321) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 719860 + ... + 738013.
It is an arithmetic number, because the mean of its divisors is an integer number (1716646635).
Almost surely, 213233113221 is an apocalyptic number.
It is an amenable number.
13233113221 is a deficient number, since it is larger than the sum of its proper divisors (500059859).
13233113221 is a wasteful number, since it uses less digits than its factorization.
13233113221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1458215.
The product of its digits is 648, while the sum is 22.
Adding to 13233113221 its reverse (12231133231), we get a palindrome (25464246452).
The spelling of 13233113221 in words is "thirteen billion, two hundred thirty-three million, one hundred thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •