Base | Representation |
---|---|
bin | 10100110111100010… |
… | …10010000100010011 |
3 | 1001220210000201202201 |
4 | 22123301102010103 |
5 | 140421022302011 |
6 | 5051410024031 |
7 | 544425444511 |
oct | 123361220423 |
9 | 31823021681 |
10 | 11203322131 |
11 | 4829a8a811 |
12 | 2207b78017 |
13 | 10970a5ac1 |
14 | 783cb94b1 |
15 | 458852cc1 |
hex | 29bc52113 |
11203322131 has 4 divisors (see below), whose sum is σ = 11203580272. Its totient is φ = 11203063992.
The previous prime is 11203322113. The next prime is 11203322147. The reversal of 11203322131 is 13122330211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13122330211 = 1597 ⋅8216863.
It is a cyclic number.
It is not a de Polignac number, because 11203322131 - 219 = 11202797843 is a prime.
It is a super-2 number, since 2×112033221312 (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 = 11203322099 and 11203322108.
It is not an unprimeable number, because it can be changed into a prime (11203320131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 46260 + ... + 156673.
It is an arithmetic number, because the mean of its divisors is an integer number (2800895068).
Almost surely, 211203322131 is an apocalyptic number.
11203322131 is a deficient number, since it is larger than the sum of its proper divisors (258141).
11203322131 is an equidigital number, since it uses as much as digits as its factorization.
11203322131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 258140.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 11203322131 its reverse (13122330211), we get a palindrome (24325652342).
The spelling of 11203322131 in words is "eleven billion, two hundred three million, three hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.167 sec. • engine limits •