Base | Representation |
---|---|
bin | 1010001100110101111100… |
… | …1010001110101110001000 |
3 | 1110201012211022212112220020 |
4 | 2203031133022032232020 |
5 | 2432224332032031422 |
6 | 35504240334100440 |
7 | 2235211615045065 |
oct | 243153712165610 |
9 | 43635738775806 |
10 | 11215756127112 |
11 | 3634636a37669 |
12 | 131183204a720 |
13 | 634844b20864 |
14 | 2aabba065c6c |
15 | 146b3300095c |
hex | a335f28eb88 |
11215756127112 has 64 divisors (see below), whose sum is σ = 30049264414080. Its totient is φ = 3479388498432.
The previous prime is 11215756127101. The next prime is 11215756127129. The reversal of 11215756127112 is 21172165751211.
11215756127112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×112157561271123 (a number of 40 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 274552533 + ... + 274593380.
It is an arithmetic number, because the mean of its divisors is an integer number (469519756470).
Almost surely, 211215756127112 is an apocalyptic number.
11215756127112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11215756127112 is an abundant number, since it is smaller than the sum of its proper divisors (18833508286968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11215756127112 is a wasteful number, since it uses less digits than its factorization.
11215756127112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 549145982 (or 549145978 counting only the distinct ones).
The product of its digits is 58800, while the sum is 42.
The spelling of 11215756127112 in words is "eleven trillion, two hundred fifteen billion, seven hundred fifty-six million, one hundred twenty-seven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •