Base | Representation |
---|---|
bin | 110010010001011011011100… |
… | …001001110011011100010100 |
3 | 1001222211221210112211111121212 |
4 | 302101123130021303130110 |
5 | 212440000320111133022 |
6 | 2102123540314200552 |
7 | 64366643416261316 |
oct | 6221333411633424 |
9 | 1058757715744555 |
10 | 221100020021012 |
11 | 644a3aa0266470 |
12 | 2096a7b9423158 |
13 | 964a84753aa22 |
14 | 3c85425c7b7b6 |
15 | 1a864bb52d3e2 |
hex | c916dc273714 |
221100020021012 has 24 divisors (see below), whose sum is σ = 422654703250752. Its totient is φ = 100367945998400.
The previous prime is 221100020021011. The next prime is 221100020021021. The reversal of 221100020021012 is 210120020001122.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221100020021011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3301543688 + ... + 3301610655.
It is an arithmetic number, because the mean of its divisors is an integer number (17610612635448).
Almost surely, 2221100020021012 is an apocalyptic number.
221100020021012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
221100020021012 is a deficient number, since it is larger than the sum of its proper divisors (201554683229740).
221100020021012 is a wasteful number, since it uses less digits than its factorization.
221100020021012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6603155119 (or 6603155117 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 221100020021012 its reverse (210120020001122), we get a palindrome (431220040022134).
The spelling of 221100020021012 in words is "two hundred twenty-one trillion, one hundred billion, twenty million, twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •