Base | Representation |
---|---|
bin | 1001101001100101011000… |
… | …11110000011111110100011 |
3 | 2210010121121111220212010101 |
4 | 10310302230132003332203 |
5 | 10240132111143112003 |
6 | 113044203110043231 |
7 | 4320045113654650 |
oct | 464625436037643 |
9 | 83117544825111 |
10 | 21220032004003 |
11 | 6841401952238 |
12 | 2468701949517 |
13 | bac06aaa0541 |
14 | 5350aaddcc27 |
15 | 26bead51011d |
hex | 134cac783fa3 |
21220032004003 has 8 divisors (see below), whose sum is σ = 24270250181120. Its totient is φ = 18174510085320.
The previous prime is 21220032003997. The next prime is 21220032004009. The reversal of 21220032004003 is 30040023002212.
It is an interprime number because it is at equal distance from previous prime (21220032003997) and next prime (21220032004009).
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 21220032004003 - 29 = 21220032003491 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21220032004009) 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, 1174054923 + ... + 1174072996.
It is an arithmetic number, because the mean of its divisors is an integer number (3033781272640).
Almost surely, 221220032004003 is an apocalyptic number.
21220032004003 is a deficient number, since it is larger than the sum of its proper divisors (3050218177117).
21220032004003 is a wasteful number, since it uses less digits than its factorization.
21220032004003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2348129217.
The product of its (nonzero) digits is 576, while the sum is 19.
Adding to 21220032004003 its reverse (30040023002212), we get a palindrome (51260055006215).
The spelling of 21220032004003 in words is "twenty-one trillion, two hundred twenty billion, thirty-two million, four thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •