Base | Representation |
---|---|
bin | 10100101111010011… |
… | …10000100101001101 |
3 | 1001201222001001102001 |
4 | 22113221300211031 |
5 | 140300331203401 |
6 | 5040501232301 |
7 | 542626326214 |
oct | 122751604515 |
9 | 31658031361 |
10 | 11134241101 |
11 | 47a3a97155 |
12 | 21a8a02691 |
13 | 1085999659 |
14 | 778a5607b |
15 | 452759601 |
hex | 297a7094d |
11134241101 has 8 divisors (see below), whose sum is σ = 11302328960. Its totient is φ = 10966209408.
The previous prime is 11134241093. The next prime is 11134241159. The reversal of 11134241101 is 10114243111.
11134241101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11134241101 - 23 = 11134241093 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 (11134241501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 561565 + ... + 581053.
It is an arithmetic number, because the mean of its divisors is an integer number (1412791120).
Almost surely, 211134241101 is an apocalyptic number.
It is an amenable number.
11134241101 is a deficient number, since it is larger than the sum of its proper divisors (168087859).
11134241101 is an equidigital number, since it uses as much as digits as its factorization.
11134241101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28083.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 11134241101 its reverse (10114243111), we get a palindrome (21248484212).
The spelling of 11134241101 in words is "eleven billion, one hundred thirty-four million, two hundred forty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •