Base | Representation |
---|---|
bin | 1100000111111111000010… |
… | …1111001001100001101001 |
3 | 1202012110110210001220102002 |
4 | 3001333300233021201221 |
5 | 3221410022014123423 |
6 | 44204154105420345 |
7 | 2544104411543630 |
oct | 301776057114151 |
9 | 52173423056362 |
10 | 13331322411113 |
11 | 427a866a55073 |
12 | 15b3848a9a6b5 |
13 | 7591a4b32aa5 |
14 | 34134d088517 |
15 | 181ba1ada228 |
hex | c1ff0bc9869 |
13331322411113 has 64 divisors (see below), whose sum is σ = 16477446635520. Its totient is φ = 10541148710400.
The previous prime is 13331322411079. The next prime is 13331322411217. The reversal of 13331322411113 is 31111422313331.
It is not a de Polignac number, because 13331322411113 - 220 = 13331321362537 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13331322413113) 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 63 ways as a sum of consecutive naturals, for example, 214516181 + ... + 214578317.
It is an arithmetic number, because the mean of its divisors is an integer number (257460103680).
Almost surely, 213331322411113 is an apocalyptic number.
It is an amenable number.
13331322411113 is a deficient number, since it is larger than the sum of its proper divisors (3146124224407).
13331322411113 is a wasteful number, since it uses less digits than its factorization.
13331322411113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62638.
The product of its digits is 3888, while the sum is 29.
Adding to 13331322411113 its reverse (31111422313331), we get a palindrome (44442744724444).
The spelling of 13331322411113 in words is "thirteen trillion, three hundred thirty-one billion, three hundred twenty-two million, four hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •