Base | Representation |
---|---|
bin | 1010001000000101110111… |
… | …1111010111100111000101 |
3 | 1110102102010210220120120121 |
4 | 2202001131333113213011 |
5 | 2424410200310432401 |
6 | 35402541044301541 |
7 | 2226262113342610 |
oct | 242013577274705 |
9 | 43372123816517 |
10 | 11134132124101 |
11 | 3602a60355038 |
12 | 12b9a523a18b1 |
13 | 629c373ca81c |
14 | 2a6c75749177 |
15 | 144957190ca1 |
hex | a205dfd79c5 |
11134132124101 has 4 divisors (see below), whose sum is σ = 12724722427552. Its totient is φ = 9543541820652.
The previous prime is 11134132124069. The next prime is 11134132124107. The reversal of 11134132124101 is 10142123143111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 11134132124101 - 25 = 11134132124069 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 (11134132124107) 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, 795295151715 + ... + 795295151728.
It is an arithmetic number, because the mean of its divisors is an integer number (3181180606888).
Almost surely, 211134132124101 is an apocalyptic number.
It is an amenable number.
11134132124101 is a deficient number, since it is larger than the sum of its proper divisors (1590590303451).
11134132124101 is an equidigital number, since it uses as much as digits as its factorization.
11134132124101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1590590303450.
The product of its (nonzero) digits is 576, while the sum is 25.
Adding to 11134132124101 its reverse (10142123143111), we get a palindrome (21276255267212).
The spelling of 11134132124101 in words is "eleven trillion, one hundred thirty-four billion, one hundred thirty-two million, one hundred twenty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •