Base | Representation |
---|---|
bin | 1001100110011110010000… |
… | …01101101110011010011101 |
3 | 2202202101122212100001001110 |
4 | 10303033020031232122131 |
5 | 10231404134031113041 |
6 | 112523122425332233 |
7 | 4306241606664153 |
oct | 463171015563235 |
9 | 82671585301043 |
10 | 21113123301021 |
11 | 680003075a354 |
12 | 244ba46337079 |
13 | ba1c60b7228b |
14 | 52dc485c93d3 |
15 | 2693029e2516 |
hex | 1333c836e69d |
21113123301021 has 4 divisors (see below), whose sum is σ = 28150831068032. Its totient is φ = 14075415534012.
The previous prime is 21113123300999. The next prime is 21113123301029. The reversal of 21113123301021 is 12010332131112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 21113123301021 - 26 = 21113123300957 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 (21113123301029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3518853883501 + ... + 3518853883506.
It is an arithmetic number, because the mean of its divisors is an integer number (7037707767008).
Almost surely, 221113123301021 is an apocalyptic number.
It is an amenable number.
21113123301021 is a deficient number, since it is larger than the sum of its proper divisors (7037707767011).
21113123301021 is an equidigital number, since it uses as much as digits as its factorization.
21113123301021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7037707767010.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 21113123301021 its reverse (12010332131112), we get a palindrome (33123455432133).
The spelling of 21113123301021 in words is "twenty-one trillion, one hundred thirteen billion, one hundred twenty-three million, three hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •