Base | Representation |
---|---|
bin | 10101001000000000… |
… | …00010111101010101 |
3 | 1002021101212022220011 |
4 | 22210000002331111 |
5 | 141211400111013 |
6 | 5113221440221 |
7 | 551023252444 |
oct | 124400027525 |
9 | 32241768804 |
10 | 11341410133 |
11 | 489aa26329 |
12 | 2246270071 |
13 | 10b9893a91 |
14 | 798382d5b |
15 | 465a2cc3d |
hex | 2a4002f55 |
11341410133 has 4 divisors (see below), whose sum is σ = 11358262828. Its totient is φ = 11324557440.
The previous prime is 11341410131. The next prime is 11341410187. The reversal of 11341410133 is 33101414311.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1289743569 + 10051666564 = 35913^2 + 100258^2 .
It is a cyclic number.
It is not a de Polignac number, because 11341410133 - 21 = 11341410131 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11341410131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8425338 + ... + 8426683.
It is an arithmetic number, because the mean of its divisors is an integer number (2839565707).
Almost surely, 211341410133 is an apocalyptic number.
It is an amenable number.
11341410133 is a deficient number, since it is larger than the sum of its proper divisors (16852695).
11341410133 is an equidigital number, since it uses as much as digits as its factorization.
11341410133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16852694.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11341410133 its reverse (33101414311), we get a palindrome (44442824444).
The spelling of 11341410133 in words is "eleven billion, three hundred forty-one million, four hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •