Base | Representation |
---|---|
bin | 1100000001100111110011… |
… | …0011111010100100001111 |
3 | 1201211000022010220201221112 |
4 | 3000121330303322210033 |
5 | 3213112130322233403 |
6 | 44042034322122235 |
7 | 2533154365605533 |
oct | 300317463724417 |
9 | 51730263821845 |
10 | 13222003321103 |
11 | 42384691a5795 |
12 | 159661a1b037b |
13 | 74baa2720105 |
14 | 339d3c4adbc3 |
15 | 17de046939d8 |
hex | c067ccfa90f |
13222003321103 has 4 divisors (see below), whose sum is σ = 13917898232760. Its totient is φ = 12526108409448.
The previous prime is 13222003321081. The next prime is 13222003321159. The reversal of 13222003321103 is 30112330022231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13222003321103 - 28 = 13222003320847 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 (13222003321183) 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, 347947455800 + ... + 347947455837.
It is an arithmetic number, because the mean of its divisors is an integer number (3479474558190).
Almost surely, 213222003321103 is an apocalyptic number.
13222003321103 is a deficient number, since it is larger than the sum of its proper divisors (695894911657).
13222003321103 is an equidigital number, since it uses as much as digits as its factorization.
13222003321103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 695894911656.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 13222003321103 its reverse (30112330022231), we get a palindrome (43334333343334).
The spelling of 13222003321103 in words is "thirteen trillion, two hundred twenty-two billion, three million, three hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •