Base | Representation |
---|---|
bin | 1001101001100111001101… |
… | …10000110100110001111101 |
3 | 2210010201010200012020211011 |
4 | 10310303212300310301331 |
5 | 10240141112030013041 |
6 | 113044444123555221 |
7 | 4320111260545135 |
oct | 464634660646175 |
9 | 83121120166734 |
10 | 21221010001021 |
11 | 6841863a07936 |
12 | 246893538bb11 |
13 | bac1955a56bc |
14 | 535160c5dac5 |
15 | 26c0192e6e81 |
hex | 134ce6c34c7d |
21221010001021 has 8 divisors (see below), whose sum is σ = 21738661104384. Its totient is φ = 20703362016480.
The previous prime is 21221010001019. The next prime is 21221010001039. The reversal of 21221010001021 is 12010001012212.
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 21221010001021 - 21 = 21221010001019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21221010000992 and 21221010001010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21221010001621) 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, 19104916 + ... + 20185138.
It is an arithmetic number, because the mean of its divisors is an integer number (2717332638048).
Almost surely, 221221010001021 is an apocalyptic number.
It is an amenable number.
21221010001021 is a deficient number, since it is larger than the sum of its proper divisors (517651103363).
21221010001021 is a wasteful number, since it uses less digits than its factorization.
21221010001021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1559411.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 21221010001021 its reverse (12010001012212), we get a palindrome (33231011013233).
The spelling of 21221010001021 in words is "twenty-one trillion, two hundred twenty-one billion, ten million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •