Base | Representation |
---|---|
bin | 1010001000000101100010… |
… | …1011110110111010001101 |
3 | 1110102101220121102212111011 |
4 | 2202001120223312322031 |
5 | 2424410010014421331 |
6 | 35402524144525221 |
7 | 2226256653011305 |
oct | 242013053667215 |
9 | 43371817385434 |
10 | 11134043123341 |
11 | 3602a15096496 |
12 | 12b9a28620811 |
13 | 629c21b38658 |
14 | 2a6c679bc605 |
15 | 14494e4603b1 |
hex | a2058af6e8d |
11134043123341 has 4 divisors (see below), whose sum is σ = 11159405408800. Its totient is φ = 11108680837884.
The previous prime is 11134043123321. The next prime is 11134043123351. The reversal of 11134043123341 is 14332134043111.
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 a cyclic number.
It is not a de Polignac number, because 11134043123341 - 213 = 11134043115149 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 (11134043123321) 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, 12681142071 + ... + 12681142948.
It is an arithmetic number, because the mean of its divisors is an integer number (2789851352200).
Almost surely, 211134043123341 is an apocalyptic number.
It is an amenable number.
11134043123341 is a deficient number, since it is larger than the sum of its proper divisors (25362285459).
11134043123341 is an equidigital number, since it uses as much as digits as its factorization.
11134043123341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25362285458.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 11134043123341 its reverse (14332134043111), we get a palindrome (25466177166452).
The spelling of 11134043123341 in words is "eleven trillion, one hundred thirty-four billion, forty-three million, one hundred twenty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •