Base | Representation |
---|---|
bin | 110010010000010000111011… |
… | …110101110101101000100110 |
3 | 1001222120022022021121020122201 |
4 | 302100100323311311220212 |
5 | 212432143000340134342 |
6 | 2102023110154045114 |
7 | 64361112106063633 |
oct | 6220207365655046 |
9 | 1058508267536581 |
10 | 221020021021222 |
11 | 64473078982905 |
12 | 209571b1a1979a |
13 | 9643138696267 |
14 | 3c815d72c318a |
15 | 1a843881aadb7 |
hex | c9043bd75a26 |
221020021021222 has 8 divisors (see below), whose sum is σ = 331532056152000. Its totient is φ = 110509335637224.
The previous prime is 221020021021199. The next prime is 221020021021223. The reversal of 221020021021222 is 222120120020122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 221020021021222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221020021021223) 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 3 ways as a sum of consecutive naturals, for example, 337027222 + ... + 337682377.
It is an arithmetic number, because the mean of its divisors is an integer number (41441507019000).
Almost surely, 2221020021021222 is an apocalyptic number.
221020021021222 is a deficient number, since it is larger than the sum of its proper divisors (110512035130778).
221020021021222 is a wasteful number, since it uses less digits than its factorization.
221020021021222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 674873390.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 221020021021222 its reverse (222120120020122), we get a palindrome (443140141041344).
The spelling of 221020021021222 in words is "two hundred twenty-one trillion, twenty billion, twenty-one million, twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •