Base | Representation |
---|---|
bin | 10011000110110010000… |
… | …001100110000010000000 |
3 | 11122111221212102102202222 |
4 | 103012302001212002000 |
5 | 133002411124201043 |
6 | 2443054533230212 |
7 | 163600112025254 |
oct | 23066201460200 |
9 | 4574855372688 |
10 | 1312951787648 |
11 | 466902067a26 |
12 | 192560a92368 |
13 | 96a704b8607 |
14 | 47793764264 |
15 | 24246001d68 |
hex | 131b2066080 |
1312951787648 has 24 divisors (see below), whose sum is σ = 2615671965855. Its totient is φ = 656469411968.
The previous prime is 1312951787647. The next prime is 1312951787737. The reversal of 1312951787648 is 8467871592131.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in only one way, i.e., 656475893824 + 656475893824 = 810232^2 + 810232^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=810232.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1312951787647) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 12913073 + ... + 13014351.
Almost surely, 21312951787648 is an apocalyptic number.
It is an amenable number.
1312951787648 is a deficient number, since it is larger than the sum of its proper divisors (1302720178207).
1312951787648 is an frugal number, since it uses more digits than its factorization.
1312951787648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202572 (or 101281 counting only the distinct ones).
The product of its digits is 20321280, while the sum is 62.
The spelling of 1312951787648 in words is "one trillion, three hundred twelve billion, nine hundred fifty-one million, seven hundred eighty-seven thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •