Base | Representation |
---|---|
bin | 1010001101111010011011… |
… | …1111101110001011010111 |
3 | 1110202222021121122002010212 |
4 | 2203132212333232023113 |
5 | 2433030010121413421 |
6 | 35520520534040035 |
7 | 2236432330434653 |
oct | 243364677561327 |
9 | 43688247562125 |
10 | 11234141201111 |
11 | 364141091a8a4 |
12 | 13153031a901b |
13 | 6364b4a6797a |
14 | 2aba41a8da63 |
15 | 14735c0bee5b |
hex | a37a6fee2d7 |
11234141201111 has 4 divisors (see below), whose sum is σ = 11246863898712. Its totient is φ = 11221418503512.
The previous prime is 11234141201099. The next prime is 11234141201113. The reversal of 11234141201111 is 11110214143211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11234141201111 - 230 = 11233067459287 is a prime.
It is a super-3 number, since 3×112341412011113 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11234141201113) 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, 6361347476 + ... + 6361349241.
It is an arithmetic number, because the mean of its divisors is an integer number (2811715974678).
Almost surely, 211234141201111 is an apocalyptic number.
11234141201111 is a deficient number, since it is larger than the sum of its proper divisors (12722697601).
11234141201111 is an equidigital number, since it uses as much as digits as its factorization.
11234141201111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12722697600.
The product of its (nonzero) digits is 192, while the sum is 23.
Adding to 11234141201111 its reverse (11110214143211), we get a palindrome (22344355344322).
The spelling of 11234141201111 in words is "eleven trillion, two hundred thirty-four billion, one hundred forty-one million, two hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •