Base | Representation |
---|---|
bin | 1100000111011001011010… |
… | …1010000101110011001111 |
3 | 1202011111101210212021020211 |
4 | 3001312112222011303033 |
5 | 3221223330111413403 |
6 | 44155403505423251 |
7 | 2543266164640024 |
oct | 301662652056317 |
9 | 52144353767224 |
10 | 13321221201103 |
11 | 42765530a2522 |
12 | 15b18aa03ab27 |
13 | 75825519a14a |
14 | 340a716db54b |
15 | 1817aedd906d |
hex | c1d96a85ccf |
13321221201103 has 4 divisors (see below), whose sum is σ = 13330582566688. Its totient is φ = 13311859835520.
The previous prime is 13321221201053. The next prime is 13321221201133. The reversal of 13321221201103 is 30110212212331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13321221201103 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 (13321221201133) 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 3 ways as a sum of consecutive naturals, for example, 4680680658 + ... + 4680683503.
It is an arithmetic number, because the mean of its divisors is an integer number (3332645641672).
Almost surely, 213321221201103 is an apocalyptic number.
13321221201103 is a deficient number, since it is larger than the sum of its proper divisors (9361365585).
13321221201103 is an equidigital number, since it uses as much as digits as its factorization.
13321221201103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9361365584.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 13321221201103 its reverse (30110212212331), we get a palindrome (43431433413434).
The spelling of 13321221201103 in words is "thirteen trillion, three hundred twenty-one billion, two hundred twenty-one million, two hundred one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •