Base | Representation |
---|---|
bin | 1010001000000001101010… |
… | …0100011110100010001101 |
3 | 1110102022012222111120112011 |
4 | 2202000122210132202031 |
5 | 2424400341224013401 |
6 | 35402232520341221 |
7 | 2226222100063120 |
oct | 242003244364215 |
9 | 43368188446464 |
10 | 11133001001101 |
11 | 360252a912641 |
12 | 12b9797614811 |
13 | 629ab6c70985 |
14 | 2a6ba94283b7 |
15 | 1448dcc0d451 |
hex | a201a91e88d |
11133001001101 has 64 divisors (see below), whose sum is σ = 13464797184000. Its totient is φ = 8999414424000.
The previous prime is 11133001001029. The next prime is 11133001001119. The reversal of 11133001001101 is 10110010033111.
It is not a de Polignac number, because 11133001001101 - 237 = 10995562047629 is a prime.
It is a super-2 number, since 2×111330010011012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11133001005101) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 2606647596 + ... + 2606651866.
It is an arithmetic number, because the mean of its divisors is an integer number (210387456000).
Almost surely, 211133001001101 is an apocalyptic number.
It is an amenable number.
11133001001101 is a deficient number, since it is larger than the sum of its proper divisors (2331796182899).
11133001001101 is a wasteful number, since it uses less digits than its factorization.
11133001001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5230.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 11133001001101 its reverse (10110010033111), we get a palindrome (21243011034212).
The spelling of 11133001001101 in words is "eleven trillion, one hundred thirty-three billion, one million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •