Base | Representation |
---|---|
bin | 1010000111011001101010… |
… | …1100100110101110001100 |
3 | 1110101021111211011110111110 |
4 | 2201312122230212232030 |
5 | 2424211400010313143 |
6 | 35353255350052020 |
7 | 2225362053456513 |
oct | 241663254465614 |
9 | 43337454143443 |
10 | 11122265713548 |
11 | 35a8a21047170 |
12 | 12b76a034a010 |
13 | 628a95b3a512 |
14 | 2a646b78367a |
15 | 1444b050c533 |
hex | a1d9ab26b8c |
11122265713548 has 24 divisors (see below), whose sum is σ = 28311221816640. Its totient is φ = 3370383549520.
The previous prime is 11122265713469. The next prime is 11122265713549. The reversal of 11122265713548 is 84531756222111.
11122265713548 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 11122265713497 and 11122265713506.
It is not an unprimeable number, because it can be changed into a prime (11122265713549) 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, 42129794238 + ... + 42129794501.
It is an arithmetic number, because the mean of its divisors is an integer number (1179634242360).
Almost surely, 211122265713548 is an apocalyptic number.
It is an amenable number.
11122265713548 is an abundant number, since it is smaller than the sum of its proper divisors (17188956103092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11122265713548 is a wasteful number, since it uses less digits than its factorization.
11122265713548 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84259588757 (or 84259588755 counting only the distinct ones).
The product of its digits is 806400, while the sum is 48.
The spelling of 11122265713548 in words is "eleven trillion, one hundred twenty-two billion, two hundred sixty-five million, seven hundred thirteen thousand, five hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •