Base | Representation |
---|---|
bin | 11001000011111011011010… |
… | …001010110100110111001001 |
3 | 112110021000221201221110011012 |
4 | 121003323122022310313021 |
5 | 103421330313410133001 |
6 | 1030230513540213305 |
7 | 32134132611265001 |
oct | 3103733212646711 |
9 | 473230851843135 |
10 | 110221111021001 |
11 | 32135568792992 |
12 | 1044170b09a235 |
13 | 4966a63207426 |
14 | 1d30a31ab5001 |
15 | cb21862142bb |
hex | 643eda2b4dc9 |
110221111021001 has 4 divisors (see below), whose sum is σ = 110238091633104. Its totient is φ = 110204130408900.
The previous prime is 110221111020971. The next prime is 110221111021033. The reversal of 110221111021001 is 100120111122011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 110221111021001 - 214 = 110221111004617 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110221111020001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8490296315 + ... + 8490309296.
It is an arithmetic number, because the mean of its divisors is an integer number (27559522908276).
Almost surely, 2110221111021001 is an apocalyptic number.
It is an amenable number.
110221111021001 is a deficient number, since it is larger than the sum of its proper divisors (16980612103).
110221111021001 is an equidigital number, since it uses as much as digits as its factorization.
110221111021001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16980612102.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 110221111021001 its reverse (100120111122011), we get a palindrome (210341222143012).
The spelling of 110221111021001 in words is "one hundred ten trillion, two hundred twenty-one billion, one hundred eleven million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •