Base | Representation |
---|---|
bin | 11001000101010001001011… |
… | …010001111001011000001101 |
3 | 112110120211122210021100222121 |
4 | 121011101023101321120031 |
5 | 103424332414432410013 |
6 | 1030341104051212541 |
7 | 32143603002303661 |
oct | 3105211321713015 |
9 | 473524583240877 |
10 | 110313203013133 |
11 | 3217062627269a |
12 | 104575305a7151 |
13 | 497264b572673 |
14 | 1d3528a7768a1 |
15 | cb477607558d |
hex | 64544b47960d |
110313203013133 has 16 divisors (see below), whose sum is σ = 121041488842560. Its totient is φ = 100068487545600.
The previous prime is 110313203013053. The next prime is 110313203013161. The reversal of 110313203013133 is 331310302313011.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110313203013133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110313203013098 and 110313203013107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110313203013193) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 195654603 + ... + 196217608.
It is an arithmetic number, because the mean of its divisors is an integer number (7565093052660).
Almost surely, 2110313203013133 is an apocalyptic number.
It is an amenable number.
110313203013133 is a deficient number, since it is larger than the sum of its proper divisors (10728285829427).
110313203013133 is a wasteful number, since it uses less digits than its factorization.
110313203013133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391872828.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 110313203013133 its reverse (331310302313011), we get a palindrome (441623505326144).
The spelling of 110313203013133 in words is "one hundred ten trillion, three hundred thirteen billion, two hundred three million, thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •