Base | Representation |
---|---|
bin | 1011111011000110111011… |
… | …0110101010100101001111 |
3 | 1201102022110102002121102101 |
4 | 2332301232312222211033 |
5 | 3204243441100330333 |
6 | 43514410301535531 |
7 | 2522113333302166 |
oct | 276615666524517 |
9 | 51368412077371 |
10 | 13110100011343 |
11 | 41a4a64749905 |
12 | 15789a9b745a7 |
13 | 74137ab0101a |
14 | 3347646003dd |
15 | 17b05543767d |
hex | bec6edaa94f |
13110100011343 has 4 divisors (see below), whose sum is σ = 13110924199000. Its totient is φ = 13109275823688.
The previous prime is 13110100011329. The next prime is 13110100011367. The reversal of 13110100011343 is 34311000101131.
It is a happy number.
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 13110100011343 - 213 = 13110100003151 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13110100011343.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13110100051343) 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, 412069968 + ... + 412101781.
It is an arithmetic number, because the mean of its divisors is an integer number (3277731049750).
Almost surely, 213110100011343 is an apocalyptic number.
13110100011343 is a deficient number, since it is larger than the sum of its proper divisors (824187657).
13110100011343 is an equidigital number, since it uses as much as digits as its factorization.
13110100011343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 824187656.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 13110100011343 its reverse (34311000101131), we get a palindrome (47421100112474).
The spelling of 13110100011343 in words is "thirteen trillion, one hundred ten billion, one hundred million, eleven thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •