Base | Representation |
---|---|
bin | 10011000100000011111… |
… | …011110011001010110101 |
3 | 11122020102022111201122101 |
4 | 103010003323303022311 |
5 | 132430420421024023 |
6 | 2441453035302101 |
7 | 163434535023523 |
oct | 23040373631265 |
9 | 4566368451571 |
10 | 1310031033013 |
11 | 46564340281a |
12 | 191a868aa931 |
13 | 966c635bb31 |
14 | 475978a9313 |
15 | 241248b31ad |
hex | 13103ef32b5 |
1310031033013 has 8 divisors (see below), whose sum is σ = 1355292905400. Its totient is φ = 1264775053248.
The previous prime is 1310031032971. The next prime is 1310031033053. The reversal of 1310031033013 is 3103301300131.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 602452287684 + 707578745329 = 776178^2 + 841177^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 1310031033013 - 233 = 1301441098421 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 (1310031033053) 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, 1018458 + ... + 1912411.
It is an arithmetic number, because the mean of its divisors is an integer number (169411613175).
Almost surely, 21310031033013 is an apocalyptic number.
It is an amenable number.
1310031033013 is a deficient number, since it is larger than the sum of its proper divisors (45261872387).
1310031033013 is a wasteful number, since it uses less digits than its factorization.
1310031033013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2946311.
The product of its (nonzero) digits is 243, while the sum is 19.
Adding to 1310031033013 its reverse (3103301300131), we get a palindrome (4413332333144).
The spelling of 1310031033013 in words is "one trillion, three hundred ten billion, thirty-one million, thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •