Base | Representation |
---|---|
bin | 1001100011001111010101… |
… | …00010011111101011001010 |
3 | 2202100202220120201200212200 |
4 | 10301213222202133223022 |
5 | 10223044124141140242 |
6 | 112400111023021030 |
7 | 4265226611460300 |
oct | 461475242375312 |
9 | 82322816650780 |
10 | 21002030021322 |
11 | 6767a02474aa9 |
12 | 243240143a776 |
13 | b9463800850c |
14 | 52870a136270 |
15 | 26649e94004c |
hex | 1319ea89faca |
21002030021322 has 72 divisors (see below), whose sum is σ = 56047434298596. Its totient is φ = 5647604707584.
The previous prime is 21002030021317. The next prime is 21002030021387. The reversal of 21002030021322 is 22312003020012.
21002030021322 is a `hidden beast` number, since 2 + 1 + 0 + 0 + 20 + 300 + 21 + 322 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 20647563393681 + 354466627641 = 4543959^2 + 595371^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 21002030021295 and 21002030021304.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 700332813 + ... + 700362800.
Almost surely, 221002030021322 is an apocalyptic number.
21002030021322 is an abundant number, since it is smaller than the sum of its proper divisors (35045404277274).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21002030021322 is a wasteful number, since it uses less digits than its factorization.
21002030021322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1400695652 (or 1400695642 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 21002030021322 its reverse (22312003020012), we get a palindrome (43314033041334).
The spelling of 21002030021322 in words is "twenty-one trillion, two billion, thirty million, twenty-one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •