Base | Representation |
---|---|
bin | 1010000000111011101000… |
… | …0001110010100010111010 |
3 | 1102222122122001001112112020 |
4 | 2200032322001302202322 |
5 | 2420401234241223002 |
6 | 35230234551055310 |
7 | 2214345605336424 |
oct | 240167201624272 |
9 | 42878561045466 |
10 | 11011122211002 |
11 | 3565877479731 |
12 | 129a042671536 |
13 | 61b46276aab4 |
14 | 2a0d26779814 |
15 | 141657d392bc |
hex | a03ba0728ba |
11011122211002 has 8 divisors (see below), whose sum is σ = 22022244422016. Its totient is φ = 3670374070332.
The previous prime is 11011122210971. The next prime is 11011122211109. The reversal of 11011122211002 is 20011222111011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
11011122211002 is an admirable number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 917593517578 + ... + 917593517589.
It is an arithmetic number, because the mean of its divisors is an integer number (2752780552752).
Almost surely, 211011122211002 is an apocalyptic number.
11011122211002 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.
11011122211002 is a wasteful number, since it uses less digits than its factorization.
11011122211002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1835187035172.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11011122211002 its reverse (20011222111011), we get a palindrome (31022344322013).
Subtracting 11011122211002 from its reverse (20011222111011), we obtain a palindrome (9000099900009).
The spelling of 11011122211002 in words is "eleven trillion, eleven billion, one hundred twenty-two million, two hundred eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •