Base | Representation |
---|---|
bin | 10100101101110001… |
… | …10101101110011001 |
3 | 1001201001220112012112 |
4 | 22112320311232121 |
5 | 140234040321423 |
6 | 5035322322105 |
7 | 542412325412 |
oct | 122670655631 |
9 | 31631815175 |
10 | 11121417113 |
11 | 4797828314 |
12 | 21a4659335 |
13 | 10831295b1 |
14 | 777078809 |
15 | 451574a78 |
hex | 296e35b99 |
11121417113 has 4 divisors (see below), whose sum is σ = 11126231808. Its totient is φ = 11116602420.
The previous prime is 11121417103. The next prime is 11121417179. The reversal of 11121417113 is 31171412111.
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, and also an emirpimes, since its reverse is a distinct semiprime: 31171412111 = 7 ⋅4453058873.
It is a cyclic number.
It is not a de Polignac number, because 11121417113 - 214 = 11121400729 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11121417103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2403881 + ... + 2408502.
It is an arithmetic number, because the mean of its divisors is an integer number (2781557952).
Almost surely, 211121417113 is an apocalyptic number.
It is an amenable number.
11121417113 is a deficient number, since it is larger than the sum of its proper divisors (4814695).
11121417113 is an equidigital number, since it uses as much as digits as its factorization.
11121417113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4814694.
The product of its digits is 168, while the sum is 23.
Adding to 11121417113 its reverse (31171412111), we get a palindrome (42292829224).
The spelling of 11121417113 in words is "eleven billion, one hundred twenty-one million, four hundred seventeen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •