Base | Representation |
---|---|
bin | 11001010000101111111111… |
… | …111000101101011101110001 |
3 | 112120101021020012001222022120 |
4 | 121100233333320231131301 |
5 | 104030244312244231001 |
6 | 1032143352430224453 |
7 | 32254604250016221 |
oct | 3120577770553561 |
9 | 476337205058276 |
10 | 111102212102001 |
11 | 3244520233715a |
12 | 1056442a055129 |
13 | 49cbb80457613 |
14 | 1d61539116081 |
15 | cca0544c1236 |
hex | 650bffe2d771 |
111102212102001 has 8 divisors (see below), whose sum is σ = 152914872570624. Its totient is φ = 71678846517360.
The previous prime is 111102212101963. The next prime is 111102212102003. The reversal of 111102212102001 is 100201212201111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111102212102001 - 213 = 111102212093809 is a prime.
It is not an unprimeable number, because it can be changed into a prime (111102212102003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 597323720886 + ... + 597323721071.
It is an arithmetic number, because the mean of its divisors is an integer number (19114359071328).
Almost surely, 2111102212102001 is an apocalyptic number.
It is an amenable number.
111102212102001 is a deficient number, since it is larger than the sum of its proper divisors (41812660468623).
111102212102001 is a wasteful number, since it uses less digits than its factorization.
111102212102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1194647441991.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 111102212102001 its reverse (100201212201111), we get a palindrome (211303424303112).
The spelling of 111102212102001 in words is "one hundred eleven trillion, one hundred two billion, two hundred twelve million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •