Base | Representation |
---|---|
bin | 1010010010100101100000… |
… | …1010111110110001101001 |
3 | 1111001122111121020200120111 |
4 | 2210221120022332301221 |
5 | 2440333414310144431 |
6 | 40021435122254321 |
7 | 2245303644536206 |
oct | 244513012766151 |
9 | 44048447220514 |
10 | 11314423131241 |
11 | 367246898918a |
12 | 13289894b73a1 |
13 | 640c3a411839 |
14 | 2b189a056cad |
15 | 1494aa1cd7b1 |
hex | a4a582bec69 |
11314423131241 has 8 divisors (see below), whose sum is σ = 11473843200768. Its totient is φ = 11155004784000.
The previous prime is 11314423131239. The next prime is 11314423131259. The reversal of 11314423131241 is 14213132441311.
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 11314423131241 - 21 = 11314423131239 is a prime.
It is a super-2 number, since 2×113144231312412 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11314423131941) 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, 18823056 + ... + 19414846.
It is an arithmetic number, because the mean of its divisors is an integer number (1434230400096).
Almost surely, 211314423131241 is an apocalyptic number.
It is an amenable number.
11314423131241 is a deficient number, since it is larger than the sum of its proper divisors (159420069527).
11314423131241 is an equidigital number, since it uses as much as digits as its factorization.
11314423131241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 861143.
The product of its digits is 6912, while the sum is 31.
Adding to 11314423131241 its reverse (14213132441311), we get a palindrome (25527555572552).
The spelling of 11314423131241 in words is "eleven trillion, three hundred fourteen billion, four hundred twenty-three million, one hundred thirty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.255 sec. • engine limits •