Base | Representation |
---|---|
bin | 1001100110011111111110… |
… | …11101101011001110010101 |
3 | 2202202111001110111212101120 |
4 | 10303033333131223032111 |
5 | 10231413033324313031 |
6 | 112523354420514153 |
7 | 4306303563515412 |
oct | 463177735531625 |
9 | 82674043455346 |
10 | 21114050229141 |
11 | 6800466a04151 |
12 | 245006484b959 |
13 | ba207ac0665c |
14 | 52dcd5755109 |
15 | 26935908ca96 |
hex | 1333ff76b395 |
21114050229141 has 8 divisors (see below), whose sum is σ = 28912933647264. Its totient is φ = 13695600148560.
The previous prime is 21114050229133. The next prime is 21114050229157. The reversal of 21114050229141 is 14192205041112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21114050229141 - 23 = 21114050229133 is a prime.
It is a super-2 number, since 2×211140502291412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21114050229121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 95108334255 + ... + 95108334476.
It is an arithmetic number, because the mean of its divisors is an integer number (3614116705908).
Almost surely, 221114050229141 is an apocalyptic number.
It is an amenable number.
21114050229141 is a deficient number, since it is larger than the sum of its proper divisors (7798883418123).
21114050229141 is a wasteful number, since it uses less digits than its factorization.
21114050229141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190216668771.
The product of its (nonzero) digits is 5760, while the sum is 33.
The spelling of 21114050229141 in words is "twenty-one trillion, one hundred fourteen billion, fifty million, two hundred twenty-nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •