Base | Representation |
---|---|
bin | 1001111111100010111011… |
… | …0110001101110001111111 |
3 | 1102220101011200112002221222 |
4 | 2133320232312031301333 |
5 | 2420004003422313302 |
6 | 35211300202143555 |
7 | 2212543561444556 |
oct | 237705666156177 |
9 | 42811150462858 |
10 | 10987312307327 |
11 | 35567693a4694 |
12 | 12954b87b1bbb |
13 | 61913996bcb5 |
14 | 29db084a4d9d |
15 | 140c12897da2 |
hex | 9fe2ed8dc7f |
10987312307327 has 2 divisors, whose sum is σ = 10987312307328. Its totient is φ = 10987312307326.
The previous prime is 10987312307239. The next prime is 10987312307329. The reversal of 10987312307327 is 72370321378901.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10987312307327 - 220 = 10987311258751 is a prime.
It is a super-3 number, since 3×109873123073273 (a number of 40 digits) contains 333 as substring.
Together with 10987312307329, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10987312307329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5493656153663 + 5493656153664.
It is an arithmetic number, because the mean of its divisors is an integer number (5493656153664).
Almost surely, 210987312307327 is an apocalyptic number.
10987312307327 is a deficient number, since it is larger than the sum of its proper divisors (1).
10987312307327 is an equidigital number, since it uses as much as digits as its factorization.
10987312307327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2667168, while the sum is 53.
The spelling of 10987312307327 in words is "ten trillion, nine hundred eighty-seven billion, three hundred twelve million, three hundred seven thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •