Base | Representation |
---|---|
bin | 1010000000010101111101… |
… | …1011001100111000010101 |
3 | 1102221200112110022100001220 |
4 | 2200011133123030320111 |
5 | 2420220033111224341 |
6 | 35221443434440553 |
7 | 2213540223633414 |
oct | 240053733147025 |
9 | 42850473270056 |
10 | 11001012211221 |
11 | 356155966320a |
12 | 12980a0893159 |
13 | 61a5110483c6 |
14 | 2a0647b8147b |
15 | 14126549da66 |
hex | a015f6cce15 |
11001012211221 has 8 divisors (see below), whose sum is σ = 14679136845120. Its totient is φ = 7328447859072.
The previous prime is 11001012211187. The next prime is 11001012211237. The reversal of 11001012211221 is 12211221010011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11001012211221 - 219 = 11001011686933 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11001012211221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001012211291) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1390065820 + ... + 1390073733.
It is an arithmetic number, because the mean of its divisors is an integer number (1834892105640).
Almost surely, 211001012211221 is an apocalyptic number.
It is an amenable number.
11001012211221 is a deficient number, since it is larger than the sum of its proper divisors (3678124633899).
11001012211221 is a wasteful number, since it uses less digits than its factorization.
11001012211221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2780140875.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11001012211221 its reverse (12211221010011), we get a palindrome (23212233221232).
The spelling of 11001012211221 in words is "eleven trillion, one billion, twelve million, two hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •