Base | Representation |
---|---|
bin | 1100000111010101101100… |
… | …0011011001001110010111 |
3 | 1202011101211010012000102012 |
4 | 3001311123003121032113 |
5 | 3221214303111420203 |
6 | 44155120344134435 |
7 | 2543232333036512 |
oct | 301653303311627 |
9 | 52141733160365 |
10 | 13320221201303 |
11 | 427608a679905 |
12 | 15b166b16741b |
13 | 758125c600a3 |
14 | 3409b898dd79 |
15 | 181752207bd8 |
hex | c1d5b0d9397 |
13320221201303 has 8 divisors (see below), whose sum is σ = 13339861194240. Its totient is φ = 13300586817280.
The previous prime is 13320221201297. The next prime is 13320221201317. The reversal of 13320221201303 is 30310212202331.
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 13320221201303 - 220 = 13320220152727 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 (13320221200303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3362858 + ... + 6160296.
It is an arithmetic number, because the mean of its divisors is an integer number (1667482649280).
Almost surely, 213320221201303 is an apocalyptic number.
13320221201303 is a deficient number, since it is larger than the sum of its proper divisors (19639992937).
13320221201303 is an equidigital number, since it uses as much as digits as its factorization.
13320221201303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2804457.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 13320221201303 its reverse (30310212202331), we get a palindrome (43630433403634).
The spelling of 13320221201303 in words is "thirteen trillion, three hundred twenty billion, two hundred twenty-one million, two hundred one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •