Base | Representation |
---|---|
bin | 10011000101100100100… |
… | …101010011010101100101 |
3 | 11122101121022122002001110 |
4 | 103011210211103111211 |
5 | 132442231021303123 |
6 | 2442322001415233 |
7 | 163522654336566 |
oct | 23054445232545 |
9 | 4571538562043 |
10 | 1311652525413 |
11 | 4662a5723a8a |
12 | 19225993a519 |
13 | 968c427b3a9 |
14 | 476acd9616d |
15 | 241bbe0a493 |
hex | 13164953565 |
1311652525413 has 8 divisors (see below), whose sum is σ = 1759342310208. Its totient is φ = 869198878784.
The previous prime is 1311652525399. The next prime is 1311652525481. The reversal of 1311652525413 is 3145252561131.
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 1311652525413 - 210 = 1311652524389 is a prime.
It is a super-2 number, since 2×13116525254132 (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 (1311652725413) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1309033956 + ... + 1309034957.
It is an arithmetic number, because the mean of its divisors is an integer number (219917788776).
Almost surely, 21311652525413 is an apocalyptic number.
It is an amenable number.
1311652525413 is a deficient number, since it is larger than the sum of its proper divisors (447689784795).
1311652525413 is a wasteful number, since it uses less digits than its factorization.
1311652525413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2618069083.
The product of its digits is 108000, while the sum is 39.
The spelling of 1311652525413 in words is "one trillion, three hundred eleven billion, six hundred fifty-two million, five hundred twenty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •