Base | Representation |
---|---|
bin | 101111111110110011011100… |
… | …000000001101110001111111 |
3 | 1000200011200220002010010022121 |
4 | 233332303130000031301333 |
5 | 210124404200200343124 |
6 | 2024451033131423411 |
7 | 62306661020222065 |
oct | 5776633400156177 |
9 | 1020150802103277 |
10 | 211024024231039 |
11 | 61269871325658 |
12 | 1b801a528b4b67 |
13 | 9099631a14456 |
14 | 3a1788db02035 |
15 | 195e3449242e4 |
hex | bfecdc00dc7f |
211024024231039 has 2 divisors, whose sum is σ = 211024024231040. Its totient is φ = 211024024231038.
The previous prime is 211024024230989. The next prime is 211024024231051. The reversal of 211024024231039 is 930132420420112.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211024024231039 is a prime.
It is a super-2 number, since 2×2110240242310392 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211024024230995 and 211024024231013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211024024241039) 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, 105512012115519 + 105512012115520.
It is an arithmetic number, because the mean of its divisors is an integer number (105512012115520).
Almost surely, 2211024024231039 is an apocalyptic number.
211024024231039 is a deficient number, since it is larger than the sum of its proper divisors (1).
211024024231039 is an equidigital number, since it uses as much as digits as its factorization.
211024024231039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 34.
The spelling of 211024024231039 in words is "two hundred eleven trillion, twenty-four billion, twenty-four million, two hundred thirty-one thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •