Base | Representation |
---|---|
bin | 1010000000111011001011… |
… | …0011110010011110111110 |
3 | 1102222122022121011110202210 |
4 | 2200032302303302132332 |
5 | 2420401012240201342 |
6 | 35230214543201250 |
7 | 2214342605040654 |
oct | 240166263623676 |
9 | 42878277143683 |
10 | 11011001100222 |
11 | 3565815079382 |
12 | 129a009ba6226 |
13 | 61b443645406 |
14 | 2a0d14650dd4 |
15 | 14164c3b479c |
hex | a03b2cf27be |
11011001100222 has 8 divisors (see below), whose sum is σ = 22022002200456. Its totient is φ = 3670333700072.
The previous prime is 11011001100221. The next prime is 11011001100227. The reversal of 11011001100222 is 22200110011011.
It is a sphenic number, since it is the product of 3 distinct primes.
11011001100222 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 11011001100198 and 11011001100207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011001100221) 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, 917583425013 + ... + 917583425024.
It is an arithmetic number, because the mean of its divisors is an integer number (2752750275057).
Almost surely, 211011001100222 is an apocalyptic number.
11011001100222 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011001100222 is a wasteful number, since it uses less digits than its factorization.
11011001100222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1835166850042.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11011001100222 its reverse (22200110011011), we get a palindrome (33211111111233).
The spelling of 11011001100222 in words is "eleven trillion, eleven billion, one million, one hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.215 sec. • engine limits •