Base | Representation |
---|---|
bin | 1001100110000111101011… |
… | …01111011011101011100110 |
3 | 2202201020101010100211002012 |
4 | 10303003311233123223212 |
5 | 10231204323031210042 |
6 | 112513355552314222 |
7 | 4305332335263350 |
oct | 463036557335346 |
9 | 82636333324065 |
10 | 21101002210022 |
11 | 67a5980711279 |
12 | 2449622b42972 |
13 | ba0a7b8c1097 |
14 | 52d41888a0d0 |
15 | 268d43802e82 |
hex | 1330f5bdbae6 |
21101002210022 has 8 divisors (see below), whose sum is σ = 36173146645776. Its totient is φ = 9043286661432.
The previous prime is 21101002210007. The next prime is 21101002210039. The reversal of 21101002210022 is 22001220010112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 1507214443573 = 21101002210022 / (2 + 1 + 1 + 0 + 1 + 0 + 0 + 2 + 2 + 1 + 0 + 0 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 21101002209979 and 21101002210006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 753607221773 + ... + 753607221800.
It is an arithmetic number, because the mean of its divisors is an integer number (4521643330722).
Almost surely, 221101002210022 is an apocalyptic number.
21101002210022 is a deficient number, since it is larger than the sum of its proper divisors (15072144435754).
21101002210022 is a wasteful number, since it uses less digits than its factorization.
21101002210022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1507214443582.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 21101002210022 its reverse (22001220010112), we get a palindrome (43102222220134).
The spelling of 21101002210022 in words is "twenty-one trillion, one hundred one billion, two million, two hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.181 sec. • engine limits •