Base | Representation |
---|---|
bin | 11101011011100011000… |
… | …10001101111100110001 |
3 | 10120200010210210200100210 |
4 | 32231301202031330301 |
5 | 113031440330010001 |
6 | 2052314331134333 |
7 | 133026012053625 |
oct | 16556142157461 |
9 | 3520123720323 |
10 | 1011222110001 |
11 | 35a947578274 |
12 | 143b942a43a9 |
13 | 7448621c10c |
14 | 36d2ca13185 |
15 | 1b486a7add6 |
hex | eb7188df31 |
1011222110001 has 4 divisors (see below), whose sum is σ = 1348296146672. Its totient is φ = 674148073332.
The previous prime is 1011222109991. The next prime is 1011222110011. The reversal of 1011222110001 is 1000112221101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (1011222109991) and next prime (1011222110011).
It is not a de Polignac number, because 1011222110001 - 214 = 1011222093617 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1011222110011) 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, 168537018331 + ... + 168537018336.
It is an arithmetic number, because the mean of its divisors is an integer number (337074036668).
Almost surely, 21011222110001 is an apocalyptic number.
It is an amenable number.
1011222110001 is a deficient number, since it is larger than the sum of its proper divisors (337074036671).
1011222110001 is an equidigital number, since it uses as much as digits as its factorization.
1011222110001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 337074036670.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1011222110001 its reverse (1000112221101), we get a palindrome (2011334331102).
The spelling of 1011222110001 in words is "one trillion, eleven billion, two hundred twenty-two million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •