Base | Representation |
---|---|
bin | 100011100111110010100110… |
… | …0111101000111000101100001 |
3 | 1112002102020202121201122012121 |
4 | 1013033211030331013011201 |
5 | 312032113004244431223 |
6 | 3030222430243224241 |
7 | 122666331023614063 |
oct | 10717451475070541 |
9 | 1462366677648177 |
10 | 313332040233313 |
11 | 90923410186a82 |
12 | 2b185a22378081 |
13 | 105ab113b7706a |
14 | 57534ccd77733 |
15 | 263574348c15d |
hex | 11cf94cf47161 |
313332040233313 has 4 divisors (see below), whose sum is σ = 319243965520788. Its totient is φ = 307420114945840.
The previous prime is 313332040233271. The next prime is 313332040233343.
313332040233313 is nontrivially palindromic in base 10.
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 103426621932544 + 209905418300769 = 10169888^2 + 14488113^2 .
It is not a de Polignac number, because 313332040233313 - 217 = 313332040102241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (313332040233343) 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, 2955962643658 + ... + 2955962643763.
It is an arithmetic number, because the mean of its divisors is an integer number (79810991380197).
Almost surely, 2313332040233313 is an apocalyptic number.
It is an amenable number.
313332040233313 is a deficient number, since it is larger than the sum of its proper divisors (5911925287475).
313332040233313 is an equidigital number, since it uses as much as digits as its factorization.
313332040233313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5911925287474.
The product of its (nonzero) digits is 104976, while the sum is 34.
The spelling of 313332040233313 in words is "three hundred thirteen trillion, three hundred thirty-two billion, forty million, two hundred thirty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •