Base | Representation |
---|---|
bin | 1010000110001110001011… |
… | …1001011110110101110100 |
3 | 1110022100012121210221100222 |
4 | 2201203202321132311310 |
5 | 2423343400031242322 |
6 | 35340104524553512 |
7 | 2224043651526242 |
oct | 241434271366564 |
9 | 43270177727328 |
10 | 11102002212212 |
11 | 35a037290274a |
12 | 12b37860b2898 |
13 | 626bb69a3a42 |
14 | 2a54a84a9792 |
15 | 143bc6591e42 |
hex | a18e2e5ed74 |
11102002212212 has 12 divisors (see below), whose sum is σ = 19511888009796. Its totient is φ = 5527177066560.
The previous prime is 11102002212199. The next prime is 11102002212227. The reversal of 11102002212212 is 21221220020111.
It can be written as a sum of positive squares in 2 ways, for example, as 1544840183056 + 9557162029156 = 1242916^2 + 3091466^2 .
It is a super-3 number, since 3×111020022122123 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5956008839 + ... + 5956010702.
It is an arithmetic number, because the mean of its divisors is an integer number (1625990667483).
Almost surely, 211102002212212 is an apocalyptic number.
It is an amenable number.
11102002212212 is a deficient number, since it is larger than the sum of its proper divisors (8409885797584).
11102002212212 is a wasteful number, since it uses less digits than its factorization.
11102002212212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11912019778 (or 11912019776 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 11102002212212 its reverse (21221220020111), we get a palindrome (32323222232323).
The spelling of 11102002212212 in words is "eleven trillion, one hundred two billion, two million, two hundred twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •