Base | Representation |
---|---|
bin | 1010000000111011001101… |
… | …0110001101000101110101 |
3 | 1102222122100020010211110110 |
4 | 2200032303112031011311 |
5 | 2420401022042401401 |
6 | 35230215504413233 |
7 | 2214343044524553 |
oct | 240166326150565 |
9 | 42878306124413 |
10 | 11011010122101 |
11 | 356581a180680 |
12 | 129a011017219 |
13 | 61b4454839c2 |
14 | 2a0d1591cbd3 |
15 | 14164d0979d6 |
hex | a03b358d175 |
11011010122101 has 64 divisors (see below), whose sum is σ = 16250992128000. Its totient is φ = 6576325217280.
The previous prime is 11011010122067. The next prime is 11011010122103. The reversal of 11011010122101 is 10122101011011.
It is not a de Polignac number, because 11011010122101 - 221 = 11011008024949 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011010122103) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 343123665 + ... + 343155753.
It is an arithmetic number, because the mean of its divisors is an integer number (253921752000).
Almost surely, 211011010122101 is an apocalyptic number.
11011010122101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11011010122101 is a deficient number, since it is larger than the sum of its proper divisors (5239982005899).
11011010122101 is a wasteful number, since it uses less digits than its factorization.
11011010122101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32794.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11011010122101 its reverse (10122101011011), we get a palindrome (21133111133112).
It can be divided in two parts, 11011010 and 122101, that added together give a palindrome (11133111).
The spelling of 11011010122101 in words is "eleven trillion, eleven billion, ten million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •