Base | Representation |
---|---|
bin | 100011100110011010010000… |
… | …0001110101101100001001101 |
3 | 1112001202010001002021210010002 |
4 | 1013030310200032231201031 |
5 | 312021010423143431222 |
6 | 3025555331502054045 |
7 | 122646533251443206 |
oct | 10714644016554115 |
9 | 1461663032253102 |
10 | 313142311311437 |
11 | 9085a9aa14a8a3 |
12 | 2b1550b257a325 |
13 | 10596268757b0a |
14 | 57482510205ad |
15 | 263083bac0392 |
hex | 11ccd203ad84d |
313142311311437 has 2 divisors, whose sum is σ = 313142311311438. Its totient is φ = 313142311311436.
The previous prime is 313142311311409. The next prime is 313142311311493. The reversal of 313142311311437 is 734113113241313.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 265178459058601 + 47963852252836 = 16284301^2 + 6925594^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-313142311311437 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 313142311311437.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (313142311311497) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156571155655718 + 156571155655719.
It is an arithmetic number, because the mean of its divisors is an integer number (156571155655719).
Almost surely, 2313142311311437 is an apocalyptic number.
It is an amenable number.
313142311311437 is a deficient number, since it is larger than the sum of its proper divisors (1).
313142311311437 is an equidigital number, since it uses as much as digits as its factorization.
313142311311437 is an evil number, because the sum of its binary digits is even.
The product of its digits is 54432, while the sum is 38.
The spelling of 313142311311437 in words is "three hundred thirteen trillion, one hundred forty-two billion, three hundred eleven million, three hundred eleven thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •