Base | Representation |
---|---|
bin | 1001100110000110001110… |
… | …01000000100110111010011 |
3 | 2202201011100121202121002021 |
4 | 10303003013020010313103 |
5 | 10231201222324003021 |
6 | 112513150214032311 |
7 | 4305304060640644 |
oct | 463030710046723 |
9 | 82634317677067 |
10 | 21100220141011 |
11 | 67a560a208250 |
12 | 2449445048697 |
13 | ba098587895b |
14 | 52d382a6b6cb |
15 | 268ce9d1dc41 |
hex | 1330c7204dd3 |
21100220141011 has 8 divisors (see below), whose sum is σ = 23553734111424. Its totient is φ = 18735924860520.
The previous prime is 21100220140981. The next prime is 21100220141041. The reversal of 21100220141011 is 11014102200112.
It is an interprime number because it is at equal distance from previous prime (21100220140981) and next prime (21100220141041).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21100220141011 is a prime.
It is not an unprimeable number, because it can be changed into a prime (21100220141041) 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, 22304671981 + ... + 22304672926.
It is an arithmetic number, because the mean of its divisors is an integer number (2944216763928).
Almost surely, 221100220141011 is an apocalyptic number.
21100220141011 is a deficient number, since it is larger than the sum of its proper divisors (2453513970413).
21100220141011 is a wasteful number, since it uses less digits than its factorization.
21100220141011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44609344961.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 21100220141011 its reverse (11014102200112), we get a palindrome (32114322341123).
The spelling of 21100220141011 in words is "twenty-one trillion, one hundred billion, two hundred twenty million, one hundred forty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.244 sec. • engine limits •