Base | Representation |
---|---|
bin | 1010000000010010111100… |
… | …1000100100010101110100 |
3 | 1102221121102222210100221111 |
4 | 2200010233020210111310 |
5 | 2420211403204121322 |
6 | 35221231213324404 |
7 | 2213511155263456 |
oct | 240045710442564 |
9 | 42847388710844 |
10 | 11000202020212 |
11 | 35611832a1769 |
12 | 1297ab5496704 |
13 | 61a412237a42 |
14 | 2a05ac3222d6 |
15 | 1412192b2177 |
hex | a012f224574 |
11000202020212 has 12 divisors (see below), whose sum is σ = 19466649643140. Its totient is φ = 5438302122176.
The previous prime is 11000202020177. The next prime is 11000202020231. The reversal of 11000202020212 is 21202020200011.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 5142853341796 + 5857348678416 = 2267786^2 + 2420196^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11000202020192 and 11000202020201.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15449721583 + ... + 15449722294.
It is an arithmetic number, because the mean of its divisors is an integer number (1622220803595).
Almost surely, 211000202020212 is an apocalyptic number.
It is an amenable number.
11000202020212 is a deficient number, since it is larger than the sum of its proper divisors (8466447622928).
11000202020212 is a wasteful number, since it uses less digits than its factorization.
11000202020212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30899443970 (or 30899443968 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 11000202020212 its reverse (21202020200011), we get a palindrome (32202222220223).
The spelling of 11000202020212 in words is "eleven trillion, two hundred two million, twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •