Base | Representation |
---|---|
bin | 11101011011100010110… |
… | …11000000110010101101 |
3 | 10120200010200020201021112 |
4 | 32231301123000302231 |
5 | 113031434334033401 |
6 | 2052314222441405 |
7 | 133025660025626 |
oct | 16556133006255 |
9 | 3520120221245 |
10 | 1011220221101 |
11 | 35a9464a80a2 |
12 | 143b93733265 |
13 | 74485a0a41c |
14 | 36d2c680a4d |
15 | 1b4868063bb |
hex | eb716c0cad |
1011220221101 has 8 divisors (see below), whose sum is σ = 1021665463224. Its totient is φ = 1000775393280.
The previous prime is 1011220221083. The next prime is 1011220221163.
1011220221101 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 4 ways, for example, as 380584117225 + 630636103876 = 616915^2 + 794126^2 .
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 1011220221101 - 222 = 1011216026797 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 (1011220211101) 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, 8321741 + ... + 8442381.
It is an arithmetic number, because the mean of its divisors is an integer number (127708182903).
Almost surely, 21011220221101 is an apocalyptic number.
It is an amenable number.
1011220221101 is a deficient number, since it is larger than the sum of its proper divisors (10445242123).
1011220221101 is an equidigital number, since it uses as much as digits as its factorization.
1011220221101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207151.
The product of its (nonzero) digits is 16, while the sum is 14.
It can be divided in two parts, 1011220 and 221101, that added together give a palindrome (1232321).
The spelling of 1011220221101 in words is "one trillion, eleven billion, two hundred twenty million, two hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •