Base | Representation |
---|---|
bin | 1100110111010111100… |
… | …0001111110010011101 |
3 | 210010111100000200200010 |
4 | 3031311320033302131 |
5 | 12110122334323401 |
6 | 245311411153433 |
7 | 21653051411442 |
oct | 3156570176235 |
9 | 703440020603 |
10 | 221021011101 |
11 | 85809664a50 |
12 | 36a035a5879 |
13 | 17ac43ac697 |
14 | a9a9c239c9 |
15 | 5b38b71ed6 |
hex | 3375e0fc9d |
221021011101 has 8 divisors (see below), whose sum is σ = 321485107104. Its totient is φ = 133952127920.
The previous prime is 221021011033. The next prime is 221021011109. The reversal of 221021011101 is 101110120122.
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 221021011101 - 215 = 221020978333 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221021011109) 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, 3348803166 + ... + 3348803231.
It is an arithmetic number, because the mean of its divisors is an integer number (40185638388).
Almost surely, 2221021011101 is an apocalyptic number.
It is an amenable number.
221021011101 is a deficient number, since it is larger than the sum of its proper divisors (100464096003).
221021011101 is a wasteful number, since it uses less digits than its factorization.
221021011101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6697606411.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 221021011101 its reverse (101110120122), we get a palindrome (322131131223).
It can be divided in two parts, 22102 and 1011101, that added together give a triangular number (1033203 = T1437).
The spelling of 221021011101 in words is "two hundred twenty-one billion, twenty-one million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •