Base | Representation |
---|---|
bin | 1011111011000111110010… |
… | …0101101100011010110011 |
3 | 1201102100001110200202211121 |
4 | 2332301330211230122303 |
5 | 3204244424043142233 |
6 | 43514445212523111 |
7 | 2522122132034662 |
oct | 276617445543263 |
9 | 51370043622747 |
10 | 13110330443443 |
11 | 41a5072827962 |
12 | 1578a53180497 |
13 | 7413b6781b8c |
14 | 334787064dd9 |
15 | 17b06a7a392d |
hex | bec7c96c6b3 |
13110330443443 has 8 divisors (see below), whose sum is σ = 13276566144000. Its totient is φ = 12944101796808.
The previous prime is 13110330443387. The next prime is 13110330443467. The reversal of 13110330443443 is 34434403301131.
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 13110330443443 - 233 = 13101740508851 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13110330443399 and 13110330443408.
It is not an unprimeable number, because it can be changed into a prime (13110330443143) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2028630 + ... + 5507812.
It is an arithmetic number, because the mean of its divisors is an integer number (1659570768000).
Almost surely, 213110330443443 is an apocalyptic number.
13110330443443 is a deficient number, since it is larger than the sum of its proper divisors (166235700557).
13110330443443 is an equidigital number, since it uses as much as digits as its factorization.
13110330443443 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3526961.
The product of its (nonzero) digits is 62208, while the sum is 34.
Adding to 13110330443443 its reverse (34434403301131), we get a palindrome (47544733744574).
The spelling of 13110330443443 in words is "thirteen trillion, one hundred ten billion, three hundred thirty million, four hundred forty-three thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •