Base | Representation |
---|---|
bin | 10100101100110011… |
… | …11101011010010011 |
3 | 1001200111200020222101 |
4 | 22112121331122103 |
5 | 140230002302011 |
6 | 5034433021231 |
7 | 542253452032 |
oct | 122631753223 |
9 | 31614606871 |
10 | 11113322131 |
11 | 47931a944a |
12 | 21a19b4817 |
13 | 1081553b72 |
14 | 775d6c719 |
15 | 4509c62c1 |
hex | 29667d693 |
11113322131 has 4 divisors (see below), whose sum is σ = 11122879032. Its totient is φ = 11103765232.
The previous prime is 11113322123. The next prime is 11113322141. The reversal of 11113322131 is 13122331111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11113322131 - 23 = 11113322123 is a prime.
It is a super-2 number, since 2×111133221312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11113322099 and 11113322108.
It is not an unprimeable number, because it can be changed into a prime (11113322141) 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, 4776706 + ... + 4779031.
It is an arithmetic number, because the mean of its divisors is an integer number (2780719758).
Almost surely, 211113322131 is an apocalyptic number.
11113322131 is a deficient number, since it is larger than the sum of its proper divisors (9556901).
11113322131 is an equidigital number, since it uses as much as digits as its factorization.
11113322131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9556900.
The product of its digits is 108, while the sum is 19.
Adding to 11113322131 its reverse (13122331111), we get a palindrome (24235653242).
The spelling of 11113322131 in words is "eleven billion, one hundred thirteen million, three hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •