Base | Representation |
---|---|
bin | 10100111110011101… |
… | …00010001110011111 |
3 | 1002001211011102211022 |
4 | 22133032202032133 |
5 | 141030344302033 |
6 | 5101241114355 |
7 | 546031441661 |
oct | 123716421637 |
9 | 32054142738 |
10 | 11261322143 |
11 | 48597a5005 |
12 | 22234889bb |
13 | 10a6102636 |
14 | 78b896531 |
15 | 45d9ad098 |
hex | 29f3a239f |
11261322143 has 4 divisors (see below), whose sum is σ = 11268071160. Its totient is φ = 11254573128.
The previous prime is 11261322131. The next prime is 11261322161. The reversal of 11261322143 is 34122316211.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 34122316211 = 53 ⋅643817287.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11261322143 is a prime.
It is a super-2 number, since 2×112613221432 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a plaindrome in base 12.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11261322103) 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, 3372005 + ... + 3375342.
It is an arithmetic number, because the mean of its divisors is an integer number (2817017790).
Almost surely, 211261322143 is an apocalyptic number.
11261322143 is a deficient number, since it is larger than the sum of its proper divisors (6749017).
11261322143 is an equidigital number, since it uses as much as digits as its factorization.
11261322143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6749016.
The product of its digits is 1728, while the sum is 26.
Adding to 11261322143 its reverse (34122316211), we get a palindrome (45383638354).
The spelling of 11261322143 in words is "eleven billion, two hundred sixty-one million, three hundred twenty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •