Base | Representation |
---|---|
bin | 1001011000001111001111… |
… | …0100010011111010000111 |
3 | 1100111211002212000112001121 |
4 | 2112003303310103322013 |
5 | 2322423000043240134 |
6 | 33533134542534411 |
7 | 2113006162334344 |
oct | 226036364237207 |
9 | 40454085015047 |
10 | 10312012086919 |
11 | 3316332a97a84 |
12 | 11a6653b97407 |
13 | 59a55979136a |
14 | 2791657177cb |
15 | 12d38be5dab4 |
hex | 960f3d13e87 |
10312012086919 has 2 divisors, whose sum is σ = 10312012086920. Its totient is φ = 10312012086918.
The previous prime is 10312012086917. The next prime is 10312012086967. The reversal of 10312012086919 is 91968021021301.
It is a weak prime.
It is an emirp because it is prime and its reverse (91968021021301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10312012086919 - 21 = 10312012086917 is a prime.
It is a super-2 number, since 2×103120120869192 (a number of 27 digits) contains 22 as substring.
Together with 10312012086917, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10312012086917) 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, 5156006043459 + 5156006043460.
It is an arithmetic number, because the mean of its divisors is an integer number (5156006043460).
Almost surely, 210312012086919 is an apocalyptic number.
10312012086919 is a deficient number, since it is larger than the sum of its proper divisors (1).
10312012086919 is an equidigital number, since it uses as much as digits as its factorization.
10312012086919 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 43.
The spelling of 10312012086919 in words is "ten trillion, three hundred twelve billion, twelve million, eighty-six thousand, nine hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •