Base | Representation |
---|---|
bin | 10011000100101010001… |
… | …011110010110101000011 |
3 | 11122022002001000211202102 |
4 | 103010222023302311003 |
5 | 132433224211311011 |
6 | 2442040441541015 |
7 | 163456456433210 |
oct | 23045213626503 |
9 | 4568061024672 |
10 | 1310672760131 |
11 | 465942670909 |
12 | 1920257a476b |
13 | 967992a7417 |
14 | 47618bd4b07 |
15 | 24160dc473b |
hex | 1312a2f2d43 |
1310672760131 has 8 divisors (see below), whose sum is σ = 1576749185280. Its totient is φ = 1064305699848.
The previous prime is 1310672760077. The next prime is 1310672760217.
1310672760131 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1310672760131 is a prime.
It is a super-2 number, since 2×13106727601312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1310672760431) 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, 4927341071 + ... + 4927341336.
It is an arithmetic number, because the mean of its divisors is an integer number (197093648160).
Almost surely, 21310672760131 is an apocalyptic number.
1310672760131 is a deficient number, since it is larger than the sum of its proper divisors (266076425149).
1310672760131 is an equidigital number, since it uses as much as digits as its factorization.
1310672760131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9854682433.
The product of its (nonzero) digits is 31752, while the sum is 38.
The spelling of 1310672760131 in words is "one trillion, three hundred ten billion, six hundred seventy-two million, seven hundred sixty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •