Base | Representation |
---|---|
bin | 10000001010111001010… |
… | …010100101101001000101 |
3 | 10221020020011001221201211 |
4 | 100022321102211221011 |
5 | 121201224304020401 |
6 | 2210252151251421 |
7 | 143165553011662 |
oct | 20127122455105 |
9 | 3836204057654 |
10 | 1111210220101 |
11 | 399297222303 |
12 | 15b43a079b71 |
13 | 80a2c4279c7 |
14 | 3bad625aa69 |
15 | 1dd89c17951 |
hex | 102b94a5a45 |
1111210220101 has 8 divisors (see below), whose sum is σ = 1151625662208. Its totient is φ = 1071080400000.
The previous prime is 1111210220083. The next prime is 1111210220111. The reversal of 1111210220101 is 1010220121111.
It is a happy number.
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 1111210220101 - 29 = 1111210219589 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 (1111210220111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71397580 + ... + 71413141.
It is an arithmetic number, because the mean of its divisors is an integer number (143953207776).
Almost surely, 21111210220101 is an apocalyptic number.
It is an amenable number.
1111210220101 is a deficient number, since it is larger than the sum of its proper divisors (40415442107).
1111210220101 is a wasteful number, since it uses less digits than its factorization.
1111210220101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142811003.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1111210220101 its reverse (1010220121111), we get a palindrome (2121430341212).
The spelling of 1111210220101 in words is "one trillion, one hundred eleven billion, two hundred ten million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •