Base | Representation |
---|---|
bin | 1011111011001000001101… |
… | …0011111110111010101101 |
3 | 1201102100100022221111011211 |
4 | 2332302003103332322231 |
5 | 3204300141432204013 |
6 | 43514504322314421 |
7 | 2522125001561140 |
oct | 276620323767255 |
9 | 51370308844154 |
10 | 13110443241133 |
11 | 41a512046a497 |
12 | 1578a84ab8a11 |
13 | 741403c56784 |
14 | 334798028057 |
15 | 17b07563523d |
hex | bec834feead |
13110443241133 has 8 divisors (see below), whose sum is σ = 14984114947200. Its totient is φ = 11236959345840.
The previous prime is 13110443241131. The next prime is 13110443241143. The reversal of 13110443241133 is 33114234401131.
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 13110443241133 - 21 = 13110443241131 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13110443241095 and 13110443241104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13110443241131) 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, 46803073 + ... + 47082358.
It is an arithmetic number, because the mean of its divisors is an integer number (1873014368400).
Almost surely, 213110443241133 is an apocalyptic number.
It is an amenable number.
13110443241133 is a deficient number, since it is larger than the sum of its proper divisors (1873671706067).
13110443241133 is an equidigital number, since it uses as much as digits as its factorization.
13110443241133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93905387.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 13110443241133 its reverse (33114234401131), we get a palindrome (46224677642264).
The spelling of 13110443241133 in words is "thirteen trillion, one hundred ten billion, four hundred forty-three million, two hundred forty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •