Base | Representation |
---|---|
bin | 1010000111111101111110… |
… | …0100010110011010110001 |
3 | 1110102012122222212000010001 |
4 | 2201333133210112122301 |
5 | 2424341324321041423 |
6 | 35401550355510001 |
7 | 2226155420133313 |
oct | 241773744263261 |
9 | 43365588760101 |
10 | 11132011112113 |
11 | 3602072075371 |
12 | 12b955bbb8301 |
13 | 629989b63a48 |
14 | 2a6b13b8d7b3 |
15 | 144880d77cad |
hex | a1fdf9166b1 |
11132011112113 has 8 divisors (see below), whose sum is σ = 11292107835456. Its totient is φ = 10972006273200.
The previous prime is 11132011112077. The next prime is 11132011112143. The reversal of 11132011112113 is 31121111023111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11132011112113 - 233 = 11123421177521 is a prime.
It is a super-2 number, since 2×111320111121132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11132011112143) 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, 22727043 + ... + 23211688.
It is an arithmetic number, because the mean of its divisors is an integer number (1411513479432).
Almost surely, 211132011112113 is an apocalyptic number.
It is an amenable number.
11132011112113 is a deficient number, since it is larger than the sum of its proper divisors (160096723343).
11132011112113 is an equidigital number, since it uses as much as digits as its factorization.
11132011112113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45942215.
The product of its (nonzero) digits is 36, while the sum is 19.
Adding to 11132011112113 its reverse (31121111023111), we get a palindrome (42253122135224).
The spelling of 11132011112113 in words is "eleven trillion, one hundred thirty-two billion, eleven million, one hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •