Base | Representation |
---|---|
bin | 10100101101111000… |
… | …10111010010110000 |
3 | 1001201010122110121001 |
4 | 22112330113102300 |
5 | 140234304403130 |
6 | 5035354211344 |
7 | 542423224156 |
oct | 122674272260 |
9 | 31633573531 |
10 | 11122341040 |
11 | 47982a9498 |
12 | 21a4a23b54 |
13 | 1083390cb5 |
14 | 7772393d6 |
15 | 4516a86ca |
hex | 296f174b0 |
11122341040 has 40 divisors (see below), whose sum is σ = 25864000848. Its totient is φ = 4448152320.
The previous prime is 11122341037. The next prime is 11122341053. The reversal of 11122341040 is 4014322111.
11122341040 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (40).
It is a junction number, because it is equal to n+sod(n) for n = 11122340999 and 11122341017.
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 7 ways as a sum of consecutive naturals, for example, 706050 + ... + 721630.
Almost surely, 211122341040 is an apocalyptic number.
11122341040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11122341040 is an abundant number, since it is smaller than the sum of its proper divisors (14741659808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11122341040 is a wasteful number, since it uses less digits than its factorization.
11122341040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24517 (or 24511 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 11122341040 its reverse (4014322111), we get a palindrome (15136663151).
The spelling of 11122341040 in words is "eleven billion, one hundred twenty-two million, three hundred forty-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •