Base | Representation |
---|---|
bin | 10011000101001100001… |
… | …111110100110101000011 |
3 | 11122100112212101010211120 |
4 | 103011030033310311003 |
5 | 132440412011222433 |
6 | 2442213254443323 |
7 | 163506566105625 |
oct | 23051417646503 |
9 | 4570485333746 |
10 | 1311244242243 |
11 | 466106210881 |
12 | 192165063543 |
13 | 9685a7c9810 |
14 | 47670a76c15 |
15 | 2419615c7b3 |
hex | 1314c3f4d43 |
1311244242243 has 8 divisors (see below), whose sum is σ = 1882812245328. Its totient is φ = 806919533664.
The previous prime is 1311244242241. The next prime is 1311244242247. The reversal of 1311244242243 is 3422424421131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1311244242243 - 21 = 1311244242241 is a prime.
It is a super-2 number, since 2×13112442422432 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1311244242241) 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, 16810823580 + ... + 16810823657.
It is an arithmetic number, because the mean of its divisors is an integer number (235351530666).
Almost surely, 21311244242243 is an apocalyptic number.
1311244242243 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1311244242243 is a deficient number, since it is larger than the sum of its proper divisors (571568003085).
1311244242243 is a wasteful number, since it uses less digits than its factorization.
1311244242243 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33621647253.
The product of its digits is 36864, while the sum is 33.
Adding to 1311244242243 its reverse (3422424421131), we get a palindrome (4733668663374).
The spelling of 1311244242243 in words is "one trillion, three hundred eleven billion, two hundred forty-four million, two hundred forty-two thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •