Base | Representation |
---|---|
bin | 10010110010011111001… |
… | …101100011101000000101 |
3 | 11120102201020210222120110 |
4 | 102302133031203220011 |
5 | 132123244244214231 |
6 | 2425052404023233 |
7 | 162166116065013 |
oct | 22623715435005 |
9 | 4512636728513 |
10 | 1291161319941 |
11 | 45863a9a5029 |
12 | 18a29b391b19 |
13 | 949a9baa63c |
14 | 466c77678b3 |
15 | 238bceb2046 |
hex | 12c9f363a05 |
1291161319941 has 8 divisors (see below), whose sum is σ = 1728751559040. Its totient is φ = 857172647072.
The previous prime is 1291161319933. The next prime is 1291161319949. The reversal of 1291161319941 is 1499131611921.
It is an interprime number because it is at equal distance from previous prime (1291161319933) and next prime (1291161319949).
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 1291161319941 - 23 = 1291161319933 is a prime.
It is a super-2 number, since 2×12911613199412 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1291161319949) 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, 900390720 + ... + 900392153.
It is an arithmetic number, because the mean of its divisors is an integer number (216093944880).
Almost surely, 21291161319941 is an apocalyptic number.
It is an amenable number.
1291161319941 is a deficient number, since it is larger than the sum of its proper divisors (437590239099).
1291161319941 is a wasteful number, since it uses less digits than its factorization.
1291161319941 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1800783115.
The product of its digits is 104976, while the sum is 48.
The spelling of 1291161319941 in words is "one trillion, two hundred ninety-one billion, one hundred sixty-one million, three hundred nineteen thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •