Base | Representation |
---|---|
bin | 1001100110011111111101… |
… | …10110101101000011011101 |
3 | 2202202111000202021211111202 |
4 | 10303033332312231003131 |
5 | 10231413023220404041 |
6 | 112523353413525245 |
7 | 4306303410625664 |
oct | 463177666550335 |
9 | 82674022254452 |
10 | 21114040013021 |
11 | 680046116667a |
12 | 2450061343825 |
13 | ba2078a6a607 |
14 | 52dcd4255ddb |
15 | 269358220a9b |
hex | 1333fedad0dd |
21114040013021 has 8 divisors (see below), whose sum is σ = 21384743738400. Its totient is φ = 20845033490160.
The previous prime is 21114040012991. The next prime is 21114040013069. The reversal of 21114040013021 is 12031004041112.
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 21114040013021 - 210 = 21114040011997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21114040012984 and 21114040013002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21114040013821) 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, 424275590 + ... + 424325351.
It is an arithmetic number, because the mean of its divisors is an integer number (2673092967300).
Almost surely, 221114040013021 is an apocalyptic number.
It is an amenable number.
21114040013021 is a deficient number, since it is larger than the sum of its proper divisors (270703725379).
21114040013021 is a wasteful number, since it uses less digits than its factorization.
21114040013021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 848601259.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 21114040013021 its reverse (12031004041112), we get a palindrome (33145044054133).
The spelling of 21114040013021 in words is "twenty-one trillion, one hundred fourteen billion, forty million, thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •