Base | Representation |
---|---|
bin | 10000000011100011100… |
… | …110010110111101011011 |
3 | 10220110212222020221200011 |
4 | 100003203212112331123 |
5 | 121034110002030243 |
6 | 2202510213222351 |
7 | 142466356130626 |
oct | 20034346267533 |
9 | 3813788227604 |
10 | 1103330111323 |
11 | 395a130a1a10 |
12 | 1599bb0319b7 |
13 | 800749a114b |
14 | 3b589880dbd |
15 | 1da7800089d |
hex | 100e3996f5b |
1103330111323 has 4 divisors (see below), whose sum is σ = 1203632848728. Its totient is φ = 1003027373920.
The previous prime is 1103330111311. The next prime is 1103330111341. The reversal of 1103330111323 is 3231110333011.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1103330111323 - 213 = 1103330103131 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1103330111294 and 1103330111303.
It is not an unprimeable number, because it can be changed into a prime (1103330111423) 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, 50151368686 + ... + 50151368707.
It is an arithmetic number, because the mean of its divisors is an integer number (300908212182).
Almost surely, 21103330111323 is an apocalyptic number.
1103330111323 is a deficient number, since it is larger than the sum of its proper divisors (100302737405).
1103330111323 is a wasteful number, since it uses less digits than its factorization.
1103330111323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100302737404.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 1103330111323 its reverse (3231110333011), we get a palindrome (4334440444334).
The spelling of 1103330111323 in words is "one trillion, one hundred three billion, three hundred thirty million, one hundred eleven thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •