Base | Representation |
---|---|
bin | 1011111010110001110111… |
… | …0000110010101111011111 |
3 | 1201101202212021100102002021 |
4 | 2332230131300302233133 |
5 | 3204200400301100421 |
6 | 43512033153441011 |
7 | 2521523231544055 |
oct | 276543560625737 |
9 | 51352767312067 |
10 | 13104444550111 |
11 | 41a2622353102 |
12 | 157788bb70167 |
13 | 740989228765 |
14 | 33438947a1d5 |
15 | 17ad23baa341 |
hex | beb1dc32bdf |
13104444550111 has 4 divisors (see below), whose sum is σ = 13126768987752. Its totient is φ = 13082120112472.
The previous prime is 13104444550069. The next prime is 13104444550133. The reversal of 13104444550111 is 11105544440131.
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 13104444550111 - 225 = 13104410995679 is a prime.
It is a super-2 number, since 2×131044445501112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13104444550811) 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, 11162217940 + ... + 11162219113.
It is an arithmetic number, because the mean of its divisors is an integer number (3281692246938).
Almost surely, 213104444550111 is an apocalyptic number.
13104444550111 is a deficient number, since it is larger than the sum of its proper divisors (22324437641).
13104444550111 is an equidigital number, since it uses as much as digits as its factorization.
13104444550111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22324437640.
The product of its (nonzero) digits is 19200, while the sum is 34.
Adding to 13104444550111 its reverse (11105544440131), we get a palindrome (24209988990242).
The spelling of 13104444550111 in words is "thirteen trillion, one hundred four billion, four hundred forty-four million, five hundred fifty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •