Base | Representation |
---|---|
bin | 1011111011000110101011… |
… | …1000001110010110100111 |
3 | 1201102022021202120212221121 |
4 | 2332301222320032112213 |
5 | 3204243322011424033 |
6 | 43514355520154411 |
7 | 2522111563331026 |
oct | 276615270162647 |
9 | 51368252525847 |
10 | 13110033311143 |
11 | 41a4a30031a7a |
12 | 157898b768a07 |
13 | 74136a049452 |
14 | 3347597da8bd |
15 | 17b04e65e62d |
hex | bec6ae0e5a7 |
13110033311143 has 4 divisors (see below), whose sum is σ = 13116886440768. Its totient is φ = 13103180181520.
The previous prime is 13110033311099. The next prime is 13110033311159. The reversal of 13110033311143 is 34111333001131.
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 13110033311143 - 233 = 13101443376551 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 (13110033371143) 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, 3426561943 + ... + 3426565768.
It is an arithmetic number, because the mean of its divisors is an integer number (3279221610192).
Almost surely, 213110033311143 is an apocalyptic number.
13110033311143 is a deficient number, since it is larger than the sum of its proper divisors (6853129625).
13110033311143 is an equidigital number, since it uses as much as digits as its factorization.
13110033311143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6853129624.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 13110033311143 its reverse (34111333001131), we get a palindrome (47221366312274).
The spelling of 13110033311143 in words is "thirteen trillion, one hundred ten billion, thirty-three million, three hundred eleven thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •