Base | Representation |
---|---|
bin | 11101001000101101110… |
… | …11100110000101011011 |
3 | 10112201001020001000112210 |
4 | 32210112323212011123 |
5 | 112400234144214321 |
6 | 2043523214410203 |
7 | 132220330312425 |
oct | 16442673460533 |
9 | 3481036030483 |
10 | 1001112101211 |
11 | 356629756002 |
12 | 142032500963 |
13 | 735347c55b1 |
14 | 36650015815 |
15 | 1b0941dcb76 |
hex | e916ee615b |
1001112101211 has 4 divisors (see below), whose sum is σ = 1334816134952. Its totient is φ = 667408067472.
The previous prime is 1001112101207. The next prime is 1001112101221. The reversal of 1001112101211 is 1121012111001.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1001112101211 - 22 = 1001112101207 is a prime.
It is a super-2 number, since 2×10011121012112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1001112101221) 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, 166852016866 + ... + 166852016871.
It is an arithmetic number, because the mean of its divisors is an integer number (333704033738).
Almost surely, 21001112101211 is an apocalyptic number.
1001112101211 is a deficient number, since it is larger than the sum of its proper divisors (333704033741).
1001112101211 is an equidigital number, since it uses as much as digits as its factorization.
1001112101211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 333704033740.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 1001112101211 its reverse (1121012111001), we get a palindrome (2122124212212).
It can be divided in two parts, 1001 and 112101211, that multiplied together give a palindrome (112213312211).
The spelling of 1001112101211 in words is "one trillion, one billion, one hundred twelve million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •