Base | Representation |
---|---|
bin | 10000010100000111011… |
… | …000000110100011111101 |
3 | 10222011210002200012202121 |
4 | 100110013120012203331 |
5 | 121332013204114401 |
6 | 2215010402522541 |
7 | 143666104443331 |
oct | 20240730064375 |
9 | 3864702605677 |
10 | 1121110223101 |
11 | 3a2507548070 |
12 | 161341666451 |
13 | 819494a2b4b |
14 | 3c394dcd7c1 |
15 | 1e268e21ca1 |
hex | 105076068fd |
1121110223101 has 8 divisors (see below), whose sum is σ = 1223246289600. Its totient is φ = 1019010315840.
The previous prime is 1121110223059. The next prime is 1121110223173. The reversal of 1121110223101 is 1013220111211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1121110223101 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 (1121110223501) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8974956 + ... + 9099013.
It is an arithmetic number, because the mean of its divisors is an integer number (152905786200).
Almost surely, 21121110223101 is an apocalyptic number.
1121110223101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1121110223101 is a deficient number, since it is larger than the sum of its proper divisors (102136066499).
1121110223101 is a wasteful number, since it uses less digits than its factorization.
1121110223101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18079619.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 1121110223101 its reverse (1013220111211), we get a palindrome (2134330334312).
The spelling of 1121110223101 in words is "one trillion, one hundred twenty-one billion, one hundred ten million, two hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.278 sec. • engine limits •