Base | Representation |
---|---|
bin | 10011000100011000001… |
… | …101001111100011000101 |
3 | 11122021022000111110110121 |
4 | 103010120031033203011 |
5 | 132432120003300041 |
6 | 2441550505221541 |
7 | 163446134666353 |
oct | 23043015174305 |
9 | 4567260443417 |
10 | 1310371150021 |
11 | 4657a839775a |
12 | 191b607918b1 |
13 | 9674b9647bb |
14 | 475cab227d3 |
15 | 241446987d1 |
hex | 1311834f8c5 |
1310371150021 has 8 divisors (see below), whose sum is σ = 1315178375000. Its totient is φ = 1305569940480.
The previous prime is 1310371149959. The next prime is 1310371150037. The reversal of 1310371150021 is 1200511730131.
It can be written as a sum of positive squares in 4 ways, for example, as 20524860225 + 1289846289796 = 143265^2 + 1135714^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 1310371150021 - 211 = 1310371147973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1310371150091) 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, 1067160 + ... + 1938961.
It is an arithmetic number, because the mean of its divisors is an integer number (164397296875).
Almost surely, 21310371150021 is an apocalyptic number.
It is an amenable number.
1310371150021 is a deficient number, since it is larger than the sum of its proper divisors (4807224979).
1310371150021 is a wasteful number, since it uses less digits than its factorization.
1310371150021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3007719.
The product of its (nonzero) digits is 630, while the sum is 25.
Adding to 1310371150021 its reverse (1200511730131), we get a palindrome (2510882880152).
The spelling of 1310371150021 in words is "one trillion, three hundred ten billion, three hundred seventy-one million, one hundred fifty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •