Base | Representation |
---|---|
bin | 10000000000100011001… |
… | …001011011110000011001 |
3 | 10220011112221200111202121 |
4 | 100000203021123300121 |
5 | 121011001413201241 |
6 | 2201213552501241 |
7 | 142323351535336 |
oct | 20004311336031 |
9 | 3804487614677 |
10 | 1100101303321 |
11 | 394606562749 |
12 | 15925984a821 |
13 | 7c97ba87077 |
14 | 3b360b1798d |
15 | 1d939811ad1 |
hex | 1002325bc19 |
1100101303321 has 4 divisors (see below), whose sum is σ = 1100106444544. Its totient is φ = 1100096162100.
The previous prime is 1100101303243. The next prime is 1100101303331. The reversal of 1100101303321 is 1233031010011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1100101303321 - 27 = 1100101303193 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100101303295 and 1100101303304.
It is not an unprimeable number, because it can be changed into a prime (1100101303331) 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, 2235045 + ... + 2682466.
It is an arithmetic number, because the mean of its divisors is an integer number (275026611136).
Almost surely, 21100101303321 is an apocalyptic number.
It is an amenable number.
1100101303321 is a deficient number, since it is larger than the sum of its proper divisors (5141223).
1100101303321 is an equidigital number, since it uses as much as digits as its factorization.
1100101303321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5141222.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 1100101303321 its reverse (1233031010011), we get a palindrome (2333132313332).
The spelling of 1100101303321 in words is "one trillion, one hundred billion, one hundred one million, three hundred three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •