Base | Representation |
---|---|
bin | 1010010011100100000000… |
… | …1010110011100000111000 |
3 | 1111010020210211110020000101 |
4 | 2210321000022303200320 |
5 | 2441122244234113422 |
6 | 40033252003245144 |
7 | 2246436464245666 |
oct | 244710012634070 |
9 | 44106724406011 |
10 | 11331200301112 |
11 | 367959819122a |
12 | 13300900797b4 |
13 | 6426b21b62a3 |
14 | 2b260c2cdc36 |
15 | 149b3d03bc27 |
hex | a4e402b3838 |
11331200301112 has 16 divisors (see below), whose sum is σ = 21275224785360. Its totient is φ = 5657807025024.
The previous prime is 11331200301107. The next prime is 11331200301131. The reversal of 11331200301112 is 21110300213311.
It is a super-2 number, since 2×113312003011122 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11331200301112.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 974134513 + ... + 974146144.
It is an arithmetic number, because the mean of its divisors is an integer number (1329701549085).
Almost surely, 211331200301112 is an apocalyptic number.
It is an amenable number.
11331200301112 is a deficient number, since it is larger than the sum of its proper divisors (9944024484248).
11331200301112 is a wasteful number, since it uses less digits than its factorization.
11331200301112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1948281390 (or 1948281386 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 11331200301112 its reverse (21110300213311), we get a palindrome (32441500514423).
The spelling of 11331200301112 in words is "eleven trillion, three hundred thirty-one billion, two hundred million, three hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •