Base | Representation |
---|---|
bin | 1010000000111011111111… |
… | …1110110110000010111111 |
3 | 1102222122220000000112111111 |
4 | 2200032333332312002333 |
5 | 2420401440324232312 |
6 | 35230252520102451 |
7 | 2214351230366425 |
oct | 240167776660277 |
9 | 42878800015444 |
10 | 11011222102207 |
11 | 35659188a6448 |
12 | 129a070004a27 |
13 | 61b47a373c12 |
14 | 2a0d35b3d115 |
15 | 1416619bb8a7 |
hex | a03bffb60bf |
11011222102207 has 4 divisors (see below), whose sum is σ = 11124739855936. Its totient is φ = 10897704348480.
The previous prime is 11011222102189. The next prime is 11011222102229. The reversal of 11011222102207 is 70220122211011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11011222102207 is a prime.
It is a super-3 number, since 3×110112221022073 (a number of 40 digits) contains 333 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 (11011222102007) 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, 56758876719 + ... + 56758876912.
It is an arithmetic number, because the mean of its divisors is an integer number (2781184963984).
Almost surely, 211011222102207 is an apocalyptic number.
11011222102207 is a deficient number, since it is larger than the sum of its proper divisors (113517753729).
11011222102207 is an equidigital number, since it uses as much as digits as its factorization.
11011222102207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113517753728.
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 11011222102207 its reverse (70220122211011), we get a palindrome (81231344313218).
The spelling of 11011222102207 in words is "eleven trillion, eleven billion, two hundred twenty-two million, one hundred two thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •