Base | Representation |
---|---|
bin | 11000011110011100… |
… | …10001110101110101 |
3 | 1020220202210120022002 |
4 | 30033032101311311 |
5 | 203402404200341 |
6 | 10011522145045 |
7 | 643425506633 |
oct | 141716216565 |
9 | 36822716262 |
10 | 13140303221 |
11 | 56333a4331 |
12 | 26687b2185 |
13 | 1315487066 |
14 | 8c924c353 |
15 | 51d91829b |
hex | 30f391d75 |
13140303221 has 8 divisors (see below), whose sum is σ = 14236827264. Its totient is φ = 12079730880.
The previous prime is 13140303217. The next prime is 13140303229. The reversal of 13140303221 is 12230304131.
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 13140303221 - 22 = 13140303217 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13140303193 and 13140303202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13140303229) 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 7 ways as a sum of consecutive naturals, for example, 8987165 + ... + 8988626.
It is an arithmetic number, because the mean of its divisors is an integer number (1779603408).
Almost surely, 213140303221 is an apocalyptic number.
It is an amenable number.
13140303221 is a deficient number, since it is larger than the sum of its proper divisors (1096524043).
13140303221 is a wasteful number, since it uses less digits than its factorization.
13140303221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17975851.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 13140303221 its reverse (12230304131), we get a palindrome (25370607352).
The spelling of 13140303221 in words is "thirteen billion, one hundred forty million, three hundred three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •