Base | Representation |
---|---|
bin | 1100000111111010001100… |
… | …1110100001000011011111 |
3 | 1202012100010011010201221202 |
4 | 3001332203032201003133 |
5 | 3221344341113323403 |
6 | 44203421053350115 |
7 | 2544030241406150 |
oct | 301764316410337 |
9 | 52170104121852 |
10 | 13330022011103 |
11 | 427a259a04316 |
12 | 15b354549833b |
13 | 7590285b7a25 |
14 | 3412684a1927 |
15 | 181b2786b688 |
hex | c1fa33a10df |
13330022011103 has 8 divisors (see below), whose sum is σ = 15234333279360. Its totient is φ = 11425716345240.
The previous prime is 13330022011057. The next prime is 13330022011181. The reversal of 13330022011103 is 30111022003331.
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 13330022011103 - 210 = 13330022010079 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 (13330022011303) 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, 7307348 + ... + 8947478.
It is an arithmetic number, because the mean of its divisors is an integer number (1904291659920).
Almost surely, 213330022011103 is an apocalyptic number.
13330022011103 is a deficient number, since it is larger than the sum of its proper divisors (1904311268257).
13330022011103 is a wasteful number, since it uses less digits than its factorization.
13330022011103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2801197.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 13330022011103 its reverse (30111022003331), we get a palindrome (43441044014434).
The spelling of 13330022011103 in words is "thirteen trillion, three hundred thirty billion, twenty-two million, eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •