Base | Representation |
---|---|
bin | 1010000000110111111001… |
… | …0111001111010111001101 |
3 | 1102222120001021110222002110 |
4 | 2200031332113033113031 |
5 | 2420342212011413401 |
6 | 35225551352014233 |
7 | 2214312032031261 |
oct | 240157627172715 |
9 | 42876037428073 |
10 | 11010121201101 |
11 | 3565403426120 |
12 | 1299a03391379 |
13 | 61b333269049 |
14 | 2a0c6d8480a1 |
15 | 1415ea0089d6 |
hex | a037e5cf5cd |
11010121201101 has 128 divisors (see below), whose sum is σ = 17354509811712. Its totient is φ = 6140914560000.
The previous prime is 11010121201087. The next prime is 11010121201109. The reversal of 11010121201101 is 10110212101011.
It is not a de Polignac number, because 11010121201101 - 211 = 11010121199053 is a prime.
It is a super-2 number, since 2×110101212011012 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010121201109) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 2810853595 + ... + 2810857511.
It is an arithmetic number, because the mean of its divisors is an integer number (135582107904).
Almost surely, 211010121201101 is an apocalyptic number.
11010121201101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11010121201101 is a deficient number, since it is larger than the sum of its proper divisors (6344388610611).
11010121201101 is a wasteful number, since it uses less digits than its factorization.
11010121201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5083.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 11010121201101 its reverse (10110212101011), we get a palindrome (21120333302112).
The spelling of 11010121201101 in words is "eleven trillion, ten billion, one hundred twenty-one million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •