Base | Representation |
---|---|
bin | 1001100011100001111010… |
… | …11100111111001110100101 |
3 | 2202101201200011202000202121 |
4 | 10301300331130333032211 |
5 | 10223230044310134341 |
6 | 112404441250305541 |
7 | 4266032135536333 |
oct | 461607534771645 |
9 | 82351604660677 |
10 | 21012011021221 |
11 | 6771164491a50 |
12 | 2434327b882b1 |
13 | b95568aa270c |
14 | 528db5950b53 |
15 | 266885ce84d1 |
hex | 131c3d73f3a5 |
21012011021221 has 8 divisors (see below), whose sum is σ = 22922355312000. Its totient is φ = 19101693642240.
The previous prime is 21012011021189. The next prime is 21012011021227. The reversal of 21012011021221 is 12212011021012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21012011021221 - 25 = 21012011021189 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21012011021195 and 21012011021204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21012011021227) 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, 5077821 + ... + 8234578.
It is an arithmetic number, because the mean of its divisors is an integer number (2865294414000).
Almost surely, 221012011021221 is an apocalyptic number.
It is an amenable number.
21012011021221 is a deficient number, since it is larger than the sum of its proper divisors (1910344290779).
21012011021221 is a wasteful number, since it uses less digits than its factorization.
21012011021221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13455899.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 21012011021221 its reverse (12212011021012), we get a palindrome (33224022042233).
The spelling of 21012011021221 in words is "twenty-one trillion, twelve billion, eleven million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •