Base | Representation |
---|---|
bin | 1010001000011111110111… |
… | …1010101010000111011000 |
3 | 1110110002011010102010021201 |
4 | 2202013331322222013120 |
5 | 2430013443203223112 |
6 | 35410053321043544 |
7 | 2226630045164434 |
oct | 242077572520730 |
9 | 43402133363251 |
10 | 11141110211032 |
11 | 3605a112a202a |
12 | 12bb27b3265b4 |
13 | 62a7aa000649 |
14 | 2a73383dd9c4 |
15 | 144c14acc257 |
hex | a21fdeaa1d8 |
11141110211032 has 32 divisors (see below), whose sum is σ = 20912436972000. Its totient is φ = 5564463381504.
The previous prime is 11141110210981. The next prime is 11141110211089. The reversal of 11141110211032 is 23011201114111.
It is a super-2 number, since 2×111411102110322 (a number of 27 digits) contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 29549818 + ... + 29924470.
It is an arithmetic number, because the mean of its divisors is an integer number (653513655375).
Almost surely, 211141110211032 is an apocalyptic number.
It is an amenable number.
11141110211032 is a deficient number, since it is larger than the sum of its proper divisors (9771326760968).
11141110211032 is a wasteful number, since it uses less digits than its factorization.
11141110211032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 378715 (or 378711 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 11141110211032 its reverse (23011201114111), we get a palindrome (34152311325143).
The spelling of 11141110211032 in words is "eleven trillion, one hundred forty-one billion, one hundred ten million, two hundred eleven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •