Base | Representation |
---|---|
bin | 1001100110001000001111… |
… | …00000001011001001010101 |
3 | 2202201021010220002021111211 |
4 | 10303010013200023021111 |
5 | 10231210430322400041 |
6 | 112513445315301421 |
7 | 4305342614202016 |
oct | 463040740131125 |
9 | 82637126067454 |
10 | 21101300200021 |
11 | 67a60139425a8 |
12 | 24496a68aa871 |
13 | ba0ac8567022 |
14 | 52d44629900d |
15 | 268d5ea66481 |
hex | 13310780b255 |
21101300200021 has 8 divisors (see below), whose sum is σ = 21555981982080. Its totient is φ = 20646856665888.
The previous prime is 21101300199971. The next prime is 21101300200063. The reversal of 21101300200021 is 12000200310112.
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 21101300200021 - 211 = 21101300197973 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21101300199974 and 21101300200010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21101300200121) 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, 59382931 + ... + 59737216.
It is an arithmetic number, because the mean of its divisors is an integer number (2694497747760).
Almost surely, 221101300200021 is an apocalyptic number.
It is an amenable number.
21101300200021 is a deficient number, since it is larger than the sum of its proper divisors (454681782059).
21101300200021 is a wasteful number, since it uses less digits than its factorization.
21101300200021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 119123963.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 21101300200021 its reverse (12000200310112), we get a palindrome (33101500510133).
The spelling of 21101300200021 in words is "twenty-one trillion, one hundred one billion, three hundred million, two hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •