Base | Representation |
---|---|
bin | 11001000101100001110000… |
… | …110101110001010001101111 |
3 | 112110122112121222222122101221 |
4 | 121011201300311301101233 |
5 | 103430130403314341221 |
6 | 1030353211230044211 |
7 | 32145103233125134 |
oct | 3105416065612157 |
9 | 473575558878357 |
10 | 110331013043311 |
11 | 321781355a29a5 |
12 | 1045aa81049667 |
13 | 497422931b168 |
14 | 1d36099c7258b |
15 | cb4e69906541 |
hex | 645870d7146f |
110331013043311 has 12 divisors (see below), whose sum is σ = 120711056340096. Its totient is φ = 100491245261760.
The previous prime is 110331013043261. The next prime is 110331013043341. The reversal of 110331013043311 is 113340310133011.
It is not a de Polignac number, because 110331013043311 - 27 = 110331013043183 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110331013043341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3376705615 + ... + 3376738288.
It is an arithmetic number, because the mean of its divisors is an integer number (10059254695008).
Almost surely, 2110331013043311 is an apocalyptic number.
110331013043311 is a deficient number, since it is larger than the sum of its proper divisors (10380043296785).
110331013043311 is an equidigital number, since it uses as much as digits as its factorization.
110331013043311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6753443982 (or 6753443951 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 110331013043311 its reverse (113340310133011), we get a palindrome (223671323176322).
The spelling of 110331013043311 in words is "one hundred ten trillion, three hundred thirty-one billion, thirteen million, forty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •