Base | Representation |
---|---|
bin | 1001000011111001001… |
… | …00101010010100110001 |
3 | 1002202120221212021201201 |
4 | 10201330210222110301 |
5 | 20100044333140031 |
6 | 355004423331201 |
7 | 31330663124506 |
oct | 4417444522461 |
9 | 1082527767651 |
10 | 311327630641 |
11 | 110040370915 |
12 | 50406bb0b01 |
13 | 234868a9731 |
14 | 110d57394ad |
15 | 8171db8d61 |
hex | 487c92a531 |
311327630641 has 2 divisors, whose sum is σ = 311327630642. Its totient is φ = 311327630640.
The previous prime is 311327630639. The next prime is 311327630681. The reversal of 311327630641 is 146036723113.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 168346090000 + 142981540641 = 410300^2 + 378129^2 .
It is a cyclic number.
It is not a de Polignac number, because 311327630641 - 21 = 311327630639 is a prime.
Together with 311327630639, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 311327630641.
It is not a weakly prime, because it can be changed into another prime (311327630681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155663815320 + 155663815321.
It is an arithmetic number, because the mean of its divisors is an integer number (155663815321).
Almost surely, 2311327630641 is an apocalyptic number.
It is an amenable number.
311327630641 is a deficient number, since it is larger than the sum of its proper divisors (1).
311327630641 is an equidigital number, since it uses as much as digits as its factorization.
311327630641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54432, while the sum is 37.
The spelling of 311327630641 in words is "three hundred eleven billion, three hundred twenty-seven million, six hundred thirty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •