Base | Representation |
---|---|
bin | 10000000001011000110… |
… | …001100010111110011101 |
3 | 10220020212122122101210222 |
4 | 100001120301202332131 |
5 | 121014322224323401 |
6 | 2201443132411125 |
7 | 142354555116155 |
oct | 20013061427635 |
9 | 3806778571728 |
10 | 1101001011101 |
11 | 394a284054a2 |
12 | 15946b016aa5 |
13 | 7ca932aa734 |
14 | 3b4083d9765 |
15 | 1d98d7d1c1b |
hex | 10058c62f9d |
1101001011101 has 8 divisors (see below), whose sum is σ = 1109586423264. Its totient is φ = 1092418338960.
The previous prime is 1101001011079. The next prime is 1101001011113. The reversal of 1101001011101 is 1011101001011.
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 1101001011101 - 230 = 1099927269277 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101001011601) 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, 125495 + ... + 1489211.
It is an arithmetic number, because the mean of its divisors is an integer number (138698302908).
Almost surely, 21101001011101 is an apocalyptic number.
It is an amenable number.
1101001011101 is a deficient number, since it is larger than the sum of its proper divisors (8585412163).
1101001011101 is a wasteful number, since it uses less digits than its factorization.
1101001011101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1370011.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 1101001011101 its reverse (1011101001011), we get a palindrome (2112102012112).
It can be divided in two parts, 1101001011 and 101, that multiplied together give a palindrome (111201102111).
The spelling of 1101001011101 in words is "one trillion, one hundred one billion, one million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •