Base | Representation |
---|---|
bin | 1010000111010001001110… |
… | …1101110111101011110100 |
3 | 1110101001122222221020112211 |
4 | 2201310103231313223310 |
5 | 2424142230241333022 |
6 | 35352242532023204 |
7 | 2225251664655100 |
oct | 241642355675364 |
9 | 43331588836484 |
10 | 11120001121012 |
11 | 35a7a6980a293 |
12 | 12b7169a61b04 |
13 | 6287c4911734 |
14 | 2a62d4ad0900 |
15 | 1443cb7d1e77 |
hex | a1d13b77af4 |
11120001121012 has 36 divisors (see below), whose sum is σ = 22653211809060. Its totient is φ = 4762332309504.
The previous prime is 11120001120953. The next prime is 11120001121039. The reversal of 11120001121012 is 21012110002111.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 461630560356 + 10658370560656 = 679434^2 + 3264716^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11120001120983 and 11120001121001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19856803 + ... + 20409130.
It is an arithmetic number, because the mean of its divisors is an integer number (629255883585).
Almost surely, 211120001121012 is an apocalyptic number.
It is an amenable number.
11120001121012 is an abundant number, since it is smaller than the sum of its proper divisors (11533210688048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11120001121012 is a wasteful number, since it uses less digits than its factorization.
11120001121012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40267360 (or 40267351 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11120001121012 its reverse (21012110002111), we get a palindrome (32132111123123).
The spelling of 11120001121012 in words is "eleven trillion, one hundred twenty billion, one million, one hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •