Base | Representation |
---|---|
bin | 1010000110000111000110… |
… | …0100111110011001001101 |
3 | 1110022011022010100220122001 |
4 | 2201201301210332121031 |
5 | 2423331001324323041 |
6 | 35335152131352301 |
7 | 2223645564554521 |
oct | 241416144763115 |
9 | 43264263326561 |
10 | 11100101011021 |
11 | 359a5877070a0 |
12 | 12b3335452691 |
13 | 626972b3c519 |
14 | 2a5367babd81 |
15 | 143b146e8131 |
hex | a187193e64d |
11100101011021 has 16 divisors (see below), whose sum is σ = 12154579193088. Its totient is φ = 10053237990400.
The previous prime is 11100101011007. The next prime is 11100101011061. The reversal of 11100101011021 is 12011010100111.
It is not a de Polignac number, because 11100101011021 - 217 = 11100100879949 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11100101010989 and 11100101011007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100101011061) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2956716 + ... + 5562586.
It is an arithmetic number, because the mean of its divisors is an integer number (759661199568).
Almost surely, 211100101011021 is an apocalyptic number.
11100101011021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11100101011021 is a deficient number, since it is larger than the sum of its proper divisors (1054478182067).
11100101011021 is a wasteful number, since it uses less digits than its factorization.
11100101011021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2607332.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 11100101011021 its reverse (12011010100111), we get a palindrome (23111111111132).
The spelling of 11100101011021 in words is "eleven trillion, one hundred billion, one hundred one million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •