Base | Representation |
---|---|
bin | 10011000110000110011… |
… | …110101100110111011001 |
3 | 11122110001221201202210112 |
4 | 103012012132230313121 |
5 | 132444412113022223 |
6 | 2442454234454105 |
7 | 163543031223323 |
oct | 23060636546731 |
9 | 4573057652715 |
10 | 1312221220313 |
11 | 46656773a973 |
12 | 192398294335 |
13 | 96985035c53 |
14 | 47724710613 |
15 | 24201ce2778 |
hex | 131867acdd9 |
1312221220313 has 8 divisors (see below), whose sum is σ = 1357558763400. Its totient is φ = 1266889579648.
The previous prime is 1312221220291. The next prime is 1312221220357. The reversal of 1312221220313 is 3130221222131.
It can be written as a sum of positive squares in 4 ways, for example, as 465578322889 + 846642897424 = 682333^2 + 920132^2 .
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 1312221220313 - 210 = 1312221219289 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1312221220363) 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, 1020908 + ... + 1914861.
It is an arithmetic number, because the mean of its divisors is an integer number (169694845425).
Almost surely, 21312221220313 is an apocalyptic number.
It is an amenable number.
1312221220313 is a deficient number, since it is larger than the sum of its proper divisors (45337543087).
1312221220313 is a wasteful number, since it uses less digits than its factorization.
1312221220313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2951211.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 1312221220313 its reverse (3130221222131), we get a palindrome (4442442442444).
The spelling of 1312221220313 in words is "one trillion, three hundred twelve billion, two hundred twenty-one million, two hundred twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •