Base | Representation |
---|---|
bin | 1001100011010001101111… |
… | …00110111001001011110101 |
3 | 2202100220020200201211122101 |
4 | 10301220313212321023311 |
5 | 10223104301143120041 |
6 | 112400443212302101 |
7 | 4265303632000636 |
oct | 461506746711365 |
9 | 82326220654571 |
10 | 21003323020021 |
11 | 6768506320071 |
12 | 2432702471931 |
13 | b947b2b617c4 |
14 | 5287cdb5388d |
15 | 2665281eab31 |
hex | 131a379b92f5 |
21003323020021 has 8 divisors (see below), whose sum is σ = 22238987158080. Its totient is φ = 19767678276288.
The previous prime is 21003323019923. The next prime is 21003323020033. The reversal of 21003323020021 is 12002032330012.
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 21003323020021 - 27 = 21003323019893 is a prime.
It is a super-2 number, since 2×210033230200212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21003323080021) 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, 2588851 + ... + 6979168.
It is an arithmetic number, because the mean of its divisors is an integer number (2779873394760).
Almost surely, 221003323020021 is an apocalyptic number.
It is an amenable number.
21003323020021 is a deficient number, since it is larger than the sum of its proper divisors (1235664138059).
21003323020021 is a wasteful number, since it uses less digits than its factorization.
21003323020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9697163.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 21003323020021 its reverse (12002032330012), we get a palindrome (33005355350033).
The spelling of 21003323020021 in words is "twenty-one trillion, three billion, three hundred twenty-three million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •