Base | Representation |
---|---|
bin | 1010000000111011111111… |
… | …1010101001101100011000 |
3 | 1102222122212220221200201022 |
4 | 2200032333322221230120 |
5 | 2420401440034044112 |
6 | 35230252440342012 |
7 | 2214351215141015 |
oct | 240167772515430 |
9 | 42878786850638 |
10 | 11011221003032 |
11 | 3565918215638 |
12 | 129a06b774908 |
13 | 61b47a07a813 |
14 | 2a0d3593470c |
15 | 141661850d72 |
hex | a03bfea9b18 |
11011221003032 has 64 divisors (see below), whose sum is σ = 21915654432000. Its totient is φ = 5172017318784.
The previous prime is 11011221003023. The next prime is 11011221003047. The reversal of 11011221003032 is 23030012211011.
It is a super-5 number, since 5×110112210030325 (a number of 66 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 11011221003032.
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 15 ways as a sum of consecutive naturals, for example, 17071718 + ... + 17704970.
It is an arithmetic number, because the mean of its divisors is an integer number (342432100500).
Almost surely, 211011221003032 is an apocalyptic number.
It is an amenable number.
11011221003032 is a deficient number, since it is larger than the sum of its proper divisors (10904433428968).
11011221003032 is a wasteful number, since it uses less digits than its factorization.
11011221003032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 634240 (or 634236 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11011221003032 its reverse (23030012211011), we get a palindrome (34041233214043).
The spelling of 11011221003032 in words is "eleven trillion, eleven billion, two hundred twenty-one million, three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •