Base | Representation |
---|---|
bin | 10100110000001010… |
… | …01001100000101101 |
3 | 1001202110112211111222 |
4 | 22120011021200231 |
5 | 140304200433401 |
6 | 5041315153125 |
7 | 543044342156 |
oct | 123005114055 |
9 | 31673484458 |
10 | 11141421101 |
11 | 47a8050638 |
12 | 21ab2a57a5 |
13 | 1087311785 |
14 | 7799a492d |
15 | 4531c6c1b |
hex | 29814982d |
11141421101 has 8 divisors (see below), whose sum is σ = 11175859104. Its totient is φ = 11107015920.
The previous prime is 11141421079. The next prime is 11141421103. The reversal of 11141421101 is 10112414111.
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 11141421101 - 222 = 11137226797 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11141421101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11141421103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 788186 + ... + 802196.
It is an arithmetic number, because the mean of its divisors is an integer number (1396982388).
Almost surely, 211141421101 is an apocalyptic number.
It is an amenable number.
11141421101 is a deficient number, since it is larger than the sum of its proper divisors (34438003).
11141421101 is a wasteful number, since it uses less digits than its factorization.
11141421101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16411.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11141421101 its reverse (10112414111), we get a palindrome (21253835212).
The spelling of 11141421101 in words is "eleven billion, one hundred forty-one million, four hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •