Base | Representation |
---|---|
bin | 11001000011101000111111… |
… | …001101001100001011011101 |
3 | 112110012010220020220200011221 |
4 | 121003220333031030023131 |
5 | 103421014311303200013 |
6 | 1030213443120213341 |
7 | 32132532502411030 |
oct | 3103507715141335 |
9 | 473163806820157 |
10 | 110201331303133 |
11 | 3212813863a114 |
12 | 1043990aa6a251 |
13 | 4964c30368765 |
14 | 1d2dab6b71017 |
15 | cb18c99ac08d |
hex | 643a3f34c2dd |
110201331303133 has 32 divisors (see below), whose sum is σ = 133384803471360. Its totient is φ = 89000814165120.
The previous prime is 110201331303127. The next prime is 110201331303143. The reversal of 110201331303133 is 331303133102011.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110201331303133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110201331303098 and 110201331303107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110201331303103) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 613917088 + ... + 614096566.
It is an arithmetic number, because the mean of its divisors is an integer number (4168275108480).
Almost surely, 2110201331303133 is an apocalyptic number.
It is an amenable number.
110201331303133 is a deficient number, since it is larger than the sum of its proper divisors (23183472168227).
110201331303133 is a wasteful number, since it uses less digits than its factorization.
110201331303133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236497.
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 110201331303133 its reverse (331303133102011), we get a palindrome (441504464405144).
The spelling of 110201331303133 in words is "one hundred ten trillion, two hundred one billion, three hundred thirty-one million, three hundred three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •