Base | Representation |
---|---|
bin | 10000001100110001101… |
… | …111010011100011011111 |
3 | 10221102102222112220222102 |
4 | 100030301233103203133 |
5 | 121214344114422421 |
6 | 2211224500035315 |
7 | 143266621330466 |
oct | 20146157234337 |
9 | 3842388486872 |
10 | 1113231014111 |
11 | 39a1339817a7 |
12 | 15b902992b3b |
13 | 80c91ca29c8 |
14 | 3bc487a99dd |
15 | 1de5733660b |
hex | 10331bd38df |
1113231014111 has 2 divisors, whose sum is σ = 1113231014112. Its totient is φ = 1113231014110.
The previous prime is 1113231014089. The next prime is 1113231014113. The reversal of 1113231014111 is 1114101323111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1113231014111 - 210 = 1113231013087 is a prime.
It is a super-2 number, since 2×11132310141112 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 1113231014113, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1113231014113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556615507055 + 556615507056.
It is an arithmetic number, because the mean of its divisors is an integer number (556615507056).
Almost surely, 21113231014111 is an apocalyptic number.
1113231014111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113231014111 is an equidigital number, since it uses as much as digits as its factorization.
1113231014111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 20.
Adding to 1113231014111 its reverse (1114101323111), we get a palindrome (2227332337222).
The spelling of 1113231014111 in words is "one trillion, one hundred thirteen billion, two hundred thirty-one million, fourteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •