Base | Representation |
---|---|
bin | 1010000111010101000100… |
… | …0011111010111001011000 |
3 | 1110101011022201112112111111 |
4 | 2201311101003322321120 |
5 | 2424201332224432022 |
6 | 35352533015110104 |
7 | 2225316332643352 |
oct | 241652103727130 |
9 | 43334281475444 |
10 | 11121030311512 |
11 | 35a8447760350 |
12 | 12b73b6672334 |
13 | 628929bcc2b4 |
14 | 2a639167a0d2 |
15 | 14443bd2c477 |
hex | a1d510fae58 |
11121030311512 has 32 divisors (see below), whose sum is σ = 22747698892800. Its totient is φ = 5054983357600.
The previous prime is 11121030311497. The next prime is 11121030311513. The reversal of 11121030311512 is 21511303012111.
It is a super-2 number, since 2×111210303115122 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11121030311513) 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, 21326937 + ... + 21842167.
It is an arithmetic number, because the mean of its divisors is an integer number (710865590400).
Almost surely, 211121030311512 is an apocalyptic number.
It is an amenable number.
11121030311512 is an abundant number, since it is smaller than the sum of its proper divisors (11626668581288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11121030311512 is a wasteful number, since it uses less digits than its factorization.
11121030311512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 760527 (or 760523 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 22.
Adding to 11121030311512 its reverse (21511303012111), we get a palindrome (32632333323623).
The spelling of 11121030311512 in words is "eleven trillion, one hundred twenty-one billion, thirty million, three hundred eleven thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •