Base | Representation |
---|---|
bin | 1010000001100000011011… |
… | …1010001111001001000100 |
3 | 1110000121010120122101112020 |
4 | 2200120012322033021010 |
5 | 2421032003003324304 |
6 | 35234551201323140 |
7 | 2215145463265563 |
oct | 240300672171104 |
9 | 43017116571466 |
10 | 11021002011204 |
11 | 3569a87355869 |
12 | 129bb3b3364b0 |
13 | 61c378591413 |
14 | 2a15c296dbda |
15 | 141a353a25d9 |
hex | a0606e8f244 |
11021002011204 has 48 divisors (see below), whose sum is σ = 25770547091520. Its totient is φ = 3665830970880.
The previous prime is 11021002011143. The next prime is 11021002011209. The reversal of 11021002011204 is 40211020012011.
It is a super-2 number, since 2×110210020112042 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11021002011209) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 29379327 + ... + 29752089.
It is an arithmetic number, because the mean of its divisors is an integer number (536886397740).
Almost surely, 211021002011204 is an apocalyptic number.
It is an amenable number.
11021002011204 is an abundant number, since it is smaller than the sum of its proper divisors (14749545080316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11021002011204 is a wasteful number, since it uses less digits than its factorization.
11021002011204 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 378020 (or 378018 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 11021002011204 its reverse (40211020012011), we get a palindrome (51232022023215).
The spelling of 11021002011204 in words is "eleven trillion, twenty-one billion, two million, eleven thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •