Base | Representation |
---|---|
bin | 1010000000111011100010… |
… | …1101011100011001110100 |
3 | 1102222122120111110012020002 |
4 | 2200032320231130121310 |
5 | 2420401213111201322 |
6 | 35230232441130432 |
7 | 2214345216366452 |
oct | 240167055343164 |
9 | 42878514405202 |
10 | 11011100100212 |
11 | 3565865a47553 |
12 | 129a037189a18 |
13 | 61b45acc89a4 |
14 | 2a0d238619d2 |
15 | 141655e1cc92 |
hex | a03b8b5c674 |
11011100100212 has 12 divisors (see below), whose sum is σ = 19294482950820. Its totient is φ = 5498390685696.
The previous prime is 11011100100197. The next prime is 11011100100227. The reversal of 11011100100212 is 21200100111011.
It is an interprime number because it is at equal distance from previous prime (11011100100197) and next prime (11011100100227).
It can be written as a sum of positive squares in 2 ways, for example, as 2595275892196 + 8415824208016 = 1610986^2 + 2901004^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11011100100193 and 11011100100202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1789837643 + ... + 1789843794.
It is an arithmetic number, because the mean of its divisors is an integer number (1607873579235).
Almost surely, 211011100100212 is an apocalyptic number.
It is an amenable number.
11011100100212 is a deficient number, since it is larger than the sum of its proper divisors (8283382850608).
11011100100212 is a wasteful number, since it uses less digits than its factorization.
11011100100212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3579682210 (or 3579682208 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11011100100212 its reverse (21200100111011), we get a palindrome (32211200211223).
The spelling of 11011100100212 in words is "eleven trillion, eleven billion, one hundred million, one hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •