Base | Representation |
---|---|
bin | 1010011001111101110111… |
… | …0111001100000101111000 |
3 | 1111111202210022012012012010 |
4 | 2212133131313030011320 |
5 | 2444423104324011212 |
6 | 40200005102245520 |
7 | 2260413046411644 |
oct | 246373567140570 |
9 | 44452708165163 |
10 | 11441220141432 |
11 | 37112155526a4 |
12 | 13494755868a0 |
13 | 64cb9683ba13 |
14 | 2b7a87d99c24 |
15 | 14c92bc5303c |
hex | a67dddcc178 |
11441220141432 has 128 divisors (see below), whose sum is σ = 32419893600000. Its totient is φ = 3342850983936.
The previous prime is 11441220141419. The next prime is 11441220141443. The reversal of 11441220141432 is 23414102214411.
It is a self number, because there is not a number n which added to its sum of digits gives 11441220141432.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12050307 + ... + 12965042.
It is an arithmetic number, because the mean of its divisors is an integer number (253280418750).
Almost surely, 211441220141432 is an apocalyptic number.
11441220141432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11441220141432 is an abundant number, since it is smaller than the sum of its proper divisors (20978673458568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11441220141432 is a wasteful number, since it uses less digits than its factorization.
11441220141432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25015453 (or 25015449 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 30.
Adding to 11441220141432 its reverse (23414102214411), we get a palindrome (34855322355843).
The spelling of 11441220141432 in words is "eleven trillion, four hundred forty-one billion, two hundred twenty million, one hundred forty-one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •