Base | Representation |
---|---|
bin | 10000000001011111110… |
… | …111110101101101100101 |
3 | 10220021011221201210202011 |
4 | 100001133313311231211 |
5 | 121020043221214341 |
6 | 2201503025114221 |
7 | 142360532300530 |
oct | 20013767655545 |
9 | 3807157653664 |
10 | 1101120101221 |
11 | 394a89655688 |
12 | 1594a2a88971 |
13 | 7cab1b7646a |
14 | 3b41a159a17 |
15 | 1d998ea7b81 |
hex | 1005fdf5b65 |
1101120101221 has 8 divisors (see below), whose sum is σ = 1258754428800. Its totient is φ = 943568637648.
The previous prime is 1101120101171. The next prime is 1101120101231. The reversal of 1101120101221 is 1221010211011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1101120101221 - 27 = 1101120101093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101120101231) 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, 20687521 + ... + 20740678.
It is an arithmetic number, because the mean of its divisors is an integer number (157344303600).
Almost surely, 21101120101221 is an apocalyptic number.
It is an amenable number.
1101120101221 is a deficient number, since it is larger than the sum of its proper divisors (157634327579).
1101120101221 is an equidigital number, since it uses as much as digits as its factorization.
1101120101221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41432003.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1101120101221 its reverse (1221010211011), we get a palindrome (2322130312232).
The spelling of 1101120101221 in words is "one trillion, one hundred one billion, one hundred twenty million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •