Base | Representation |
---|---|
bin | 10000010100000010000… |
… | …100100000101011001101 |
3 | 10222011112220011102112111 |
4 | 100110002010200223031 |
5 | 121331322411413401 |
6 | 2214553502504021 |
7 | 143663643663064 |
oct | 20240204405315 |
9 | 3864486142474 |
10 | 1121021201101 |
11 | 3a247127456a |
12 | 161317895011 |
13 | 81933c040c9 |
14 | 3c3872591db |
15 | 1e2611d9e51 |
hex | 10502120acd |
1121021201101 has 16 divisors (see below), whose sum is σ = 1153383162624. Its totient is φ = 1089124576384.
The previous prime is 1121021201089. The next prime is 1121021201107. The reversal of 1121021201101 is 1011021201211.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1121021201101 - 29 = 1121021200589 is a prime.
It is a super-2 number, since 2×11210212011012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121021201107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2087025 + ... + 2568601.
It is an arithmetic number, because the mean of its divisors is an integer number (72086447664).
Almost surely, 21121021201101 is an apocalyptic number.
It is an amenable number.
1121021201101 is a deficient number, since it is larger than the sum of its proper divisors (32361961523).
1121021201101 is a wasteful number, since it uses less digits than its factorization.
1121021201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482060.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1121021201101 its reverse (1011021201211), we get a palindrome (2132042402312).
The spelling of 1121021201101 in words is "one trillion, one hundred twenty-one billion, twenty-one million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •