Base | Representation |
---|---|
bin | 1001001000010001000… |
… | …00000110010111111001 |
3 | 1002222122120022110021111 |
4 | 10210020200012113321 |
5 | 20114401330320144 |
6 | 400033405040321 |
7 | 31443110406415 |
oct | 4441040062771 |
9 | 1088576273244 |
10 | 313675245049 |
11 | 111035553311 |
12 | 509612560a1 |
13 | 2376c08319a |
14 | 1127943dd45 |
15 | 825d043534 |
hex | 49088065f9 |
313675245049 has 2 divisors, whose sum is σ = 313675245050. Its totient is φ = 313675245048.
The previous prime is 313675244963. The next prime is 313675245077. The reversal of 313675245049 is 940542576313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 161227947024 + 152447298025 = 401532^2 + 390445^2 .
It is a cyclic number.
It is not a de Polignac number, because 313675245049 - 29 = 313675244537 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 313675244993 and 313675245011.
It is not a weakly prime, because it can be changed into another prime (313675249049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156837622524 + 156837622525.
It is an arithmetic number, because the mean of its divisors is an integer number (156837622525).
Almost surely, 2313675245049 is an apocalyptic number.
It is an amenable number.
313675245049 is a deficient number, since it is larger than the sum of its proper divisors (1).
313675245049 is an equidigital number, since it uses as much as digits as its factorization.
313675245049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2721600, while the sum is 49.
The spelling of 313675245049 in words is "three hundred thirteen billion, six hundred seventy-five million, two hundred forty-five thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •