Base | Representation |
---|---|
bin | 10000000001011111010… |
… | …001101100100001101001 |
3 | 10220021011020220210120010 |
4 | 100001133101230201221 |
5 | 121020033141231441 |
6 | 2201502030522133 |
7 | 142360351303611 |
oct | 20013721544151 |
9 | 3807136823503 |
10 | 1101110102121 |
11 | 394a83a46167 |
12 | 15949b666349 |
13 | 7caaca85133 |
14 | 3b418ab5a41 |
15 | 1d998180116 |
hex | 1005f46c869 |
1101110102121 has 8 divisors (see below), whose sum is σ = 1474289677440. Its totient is φ = 731001964112.
The previous prime is 1101110102107. The next prime is 1101110102153. The reversal of 1101110102121 is 1212010111011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1101110102121 - 214 = 1101110085737 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1101110102097 and 1101110102106.
It is not an unprimeable number, because it can be changed into a prime (1101110102821) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 767858490 + ... + 767859923.
It is an arithmetic number, because the mean of its divisors is an integer number (184286209680).
Almost surely, 21101110102121 is an apocalyptic number.
It is an amenable number.
1101110102121 is a deficient number, since it is larger than the sum of its proper divisors (373179575319).
1101110102121 is a wasteful number, since it uses less digits than its factorization.
1101110102121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1535718655.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 1101110102121 its reverse (1212010111011), we get a palindrome (2313120213132).
The spelling of 1101110102121 in words is "one trillion, one hundred one billion, one hundred ten million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •