Base | Representation |
---|---|
bin | 10011000101000101101… |
… | …100100101010100111010 |
3 | 11122100021012120112212022 |
4 | 103011011230211110322 |
5 | 132440200342343120 |
6 | 2442154331114442 |
7 | 163504063003256 |
oct | 23050554452472 |
9 | 4570235515768 |
10 | 1311134340410 |
11 | 46605a176a14 |
12 | 1921342a2a22 |
13 | 96840aca04b |
14 | 47660229266 |
15 | 2418b69e025 |
hex | 13145b2553a |
1311134340410 has 8 divisors (see below), whose sum is σ = 2360041812756. Its totient is φ = 524453736160.
The previous prime is 1311134340403. The next prime is 1311134340443. The reversal of 1311134340410 is 140434311131.
It can be written as a sum of positive squares in 2 ways, for example, as 1213850859001 + 97283481409 = 1101749^2 + 311903^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1311134340410.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 65556717011 + ... + 65556717030.
Almost surely, 21311134340410 is an apocalyptic number.
1311134340410 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1311134340410 is a deficient number, since it is larger than the sum of its proper divisors (1048907472346).
1311134340410 is a wasteful number, since it uses less digits than its factorization.
1311134340410 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131113434048.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 1311134340410 its reverse (140434311131), we get a palindrome (1451568651541).
The spelling of 1311134340410 in words is "one trillion, three hundred eleven billion, one hundred thirty-four million, three hundred forty thousand, four hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •