Base | Representation |
---|---|
bin | 10010111011110001011… |
… | …100111100100000011001 |
3 | 11121101110001120020102101 |
4 | 102323301130330200121 |
5 | 132304204020122223 |
6 | 2433421545203401 |
7 | 163001145122605 |
oct | 22736134744031 |
9 | 4541401506371 |
10 | 1301131020313 |
11 | 4618965a4523 |
12 | 190202190561 |
13 | 95908519627 |
14 | 46d91880505 |
15 | 23ca33874ad |
hex | 12ef173c819 |
1301131020313 has 4 divisors (see below), whose sum is σ = 1308319589668. Its totient is φ = 1293942450960.
The previous prime is 1301131020269. The next prime is 1301131020341. The reversal of 1301131020313 is 3130201311031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 677809717264 + 623321303049 = 823292^2 + 789507^2 .
It is a cyclic number.
It is not a de Polignac number, because 1301131020313 - 221 = 1301128923161 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1301131020353) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3594284406 + ... + 3594284767.
It is an arithmetic number, because the mean of its divisors is an integer number (327079897417).
Almost surely, 21301131020313 is an apocalyptic number.
It is an amenable number.
1301131020313 is a deficient number, since it is larger than the sum of its proper divisors (7188569355).
1301131020313 is an equidigital number, since it uses as much as digits as its factorization.
1301131020313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7188569354.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1301131020313 its reverse (3130201311031), we get a palindrome (4431332331344).
The spelling of 1301131020313 in words is "one trillion, three hundred one billion, one hundred thirty-one million, twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •