Base | Representation |
---|---|
bin | 10100111011001111… |
… | …00111100011011101 |
3 | 1001222221101202120201 |
4 | 22131213213203131 |
5 | 141001442440013 |
6 | 5054434543501 |
7 | 545253224656 |
oct | 123547474335 |
9 | 31887352521 |
10 | 11234343133 |
11 | 4845548302 |
12 | 2216437b91 |
13 | 10a0647720 |
14 | 78807252d |
15 | 45b42e3dd |
hex | 29d9e78dd |
11234343133 has 8 divisors (see below), whose sum is σ = 12099563000. Its totient is φ = 10369271808.
The previous prime is 11234343101. The next prime is 11234343173. The reversal of 11234343133 is 33134343211.
It can be written as a sum of positive squares in 4 ways, for example, as 5008817529 + 6225525604 = 70773^2 + 78902^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11234343133 - 25 = 11234343101 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 (11234343173) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 157933 + ... + 217741.
It is an arithmetic number, because the mean of its divisors is an integer number (1512445375).
Almost surely, 211234343133 is an apocalyptic number.
11234343133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11234343133 is a deficient number, since it is larger than the sum of its proper divisors (865219867).
11234343133 is a wasteful number, since it uses less digits than its factorization.
11234343133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74271.
The product of its digits is 7776, while the sum is 28.
Adding to 11234343133 its reverse (33134343211), we get a palindrome (44368686344).
The spelling of 11234343133 in words is "eleven billion, two hundred thirty-four million, three hundred forty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •