Base | Representation |
---|---|
bin | 1010000000111011001111… |
… | …1111110001101111000101 |
3 | 1102222122100222122111201002 |
4 | 2200032303333301233011 |
5 | 2420401032340120401 |
6 | 35230220534143045 |
7 | 2214343236254264 |
oct | 240166377615705 |
9 | 42878328574632 |
10 | 11011021020101 |
11 | 3565825344493 |
12 | 129a0147b1a85 |
13 | 61b4477cb21b |
14 | 2a0d171585db |
15 | 14164deeba6b |
hex | a03b3ff1bc5 |
11011021020101 has 4 divisors (see below), whose sum is σ = 11012138106252. Its totient is φ = 11009903933952.
The previous prime is 11011021020091. The next prime is 11011021020143. The reversal of 11011021020101 is 10102012011011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5397485916001 + 5613535104100 = 2323249^2 + 2369290^2 .
It is a cyclic number.
It is not a de Polignac number, because 11011021020101 - 242 = 6612974508997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011021020191) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 558528290 + ... + 558548003.
It is an arithmetic number, because the mean of its divisors is an integer number (2753034526563).
Almost surely, 211011021020101 is an apocalyptic number.
It is an amenable number.
11011021020101 is a deficient number, since it is larger than the sum of its proper divisors (1117086151).
11011021020101 is an equidigital number, since it uses as much as digits as its factorization.
11011021020101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1117086150.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11011021020101 its reverse (10102012011011), we get a palindrome (21113033031112).
The spelling of 11011021020101 in words is "eleven trillion, eleven billion, twenty-one million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •