Base | Representation |
---|---|
bin | 100011011010000010001101… |
… | …0001100111001100101000101 |
3 | 1111211201111200212110020222202 |
4 | 1012310010122030321211011 |
5 | 311310123443144432122 |
6 | 3022214112212404245 |
7 | 122412620205422024 |
oct | 10664043214714505 |
9 | 1454644625406882 |
10 | 311441403124037 |
11 | 9026461489170a |
12 | 2ab1b51b916685 |
13 | 104a1a4bb20164 |
14 | 56c9bb6c248bb |
15 | 260148b6a8e92 |
hex | 11b411a339945 |
311441403124037 has 2 divisors, whose sum is σ = 311441403124038. Its totient is φ = 311441403124036.
The previous prime is 311441403124009. The next prime is 311441403124073. The reversal of 311441403124037 is 730421304144113.
Together with next prime (311441403124073) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 218002094831236 + 93439308292801 = 14764894^2 + 9666401^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-311441403124037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (311441403124837) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155720701562018 + 155720701562019.
It is an arithmetic number, because the mean of its divisors is an integer number (155720701562019).
Almost surely, 2311441403124037 is an apocalyptic number.
It is an amenable number.
311441403124037 is a deficient number, since it is larger than the sum of its proper divisors (1).
311441403124037 is an equidigital number, since it uses as much as digits as its factorization.
311441403124037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96768, while the sum is 38.
The spelling of 311441403124037 in words is "three hundred eleven trillion, four hundred forty-one billion, four hundred three million, one hundred twenty-four thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •