Base | Representation |
---|---|
bin | 1100000111011100101100… |
… | …0110010000101110011001 |
3 | 1202011120200010100201222101 |
4 | 3001313023012100232121 |
5 | 3221232130324013423 |
6 | 44200031054523401 |
7 | 2543330040054442 |
oct | 301671306205631 |
9 | 52146603321871 |
10 | 13322101001113 |
11 | 4276964788273 |
12 | 15b1ab4806561 |
13 | 758365540378 |
14 | 340b164ba2c9 |
15 | 1818122757ad |
hex | c1dcb190b99 |
13322101001113 has 4 divisors (see below), whose sum is σ = 13322112632100. Its totient is φ = 13322089370128.
The previous prime is 13322101001087. The next prime is 13322101001177. The reversal of 13322101001113 is 31110010122331.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6379524195984 + 6942576805129 = 2525772^2 + 2634877^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13322101001113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13322101002113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3883438 + ... + 6459511.
It is an arithmetic number, because the mean of its divisors is an integer number (3330528158025).
Almost surely, 213322101001113 is an apocalyptic number.
It is an amenable number.
13322101001113 is a deficient number, since it is larger than the sum of its proper divisors (11630987).
13322101001113 is a wasteful number, since it uses less digits than its factorization.
13322101001113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11630986.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 13322101001113 its reverse (31110010122331), we get a palindrome (44432111123444).
The spelling of 13322101001113 in words is "thirteen trillion, three hundred twenty-two billion, one hundred one million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •