Base | Representation |
---|---|
bin | 100011011010000001100110… |
… | …0101110100011101001010011 |
3 | 1111211201101100021122120212122 |
4 | 1012310003030232203221103 |
5 | 311310113312422333433 |
6 | 3022213335221244455 |
7 | 122412543043334165 |
oct | 10664031456435123 |
9 | 1454641307576778 |
10 | 311440103324243 |
11 | 90264008110903 |
12 | 2ab1b21856372b |
13 | 104a18a275535a |
14 | 56c9ad2356935 |
15 | 2601412508198 |
hex | 11b40ccba3a53 |
311440103324243 has 2 divisors, whose sum is σ = 311440103324244. Its totient is φ = 311440103324242.
The previous prime is 311440103324167. The next prime is 311440103324263. The reversal of 311440103324243 is 342423301044113.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 311440103324243 - 212 = 311440103320147 is a prime.
It is a super-3 number, since 3×3114401033242433 (a number of 44 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (311440103324263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155720051662121 + 155720051662122.
It is an arithmetic number, because the mean of its divisors is an integer number (155720051662122).
Almost surely, 2311440103324243 is an apocalyptic number.
311440103324243 is a deficient number, since it is larger than the sum of its proper divisors (1).
311440103324243 is an equidigital number, since it uses as much as digits as its factorization.
311440103324243 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 82944, while the sum is 35.
Adding to 311440103324243 its reverse (342423301044113), we get a palindrome (653863404368356).
The spelling of 311440103324243 in words is "three hundred eleven trillion, four hundred forty billion, one hundred three million, three hundred twenty-four thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •