Base | Representation |
---|---|
bin | 10110110010010100110011… |
… | …110111010010111101110111 |
3 | 111010211111022111101011111022 |
4 | 112302110303313102331313 |
5 | 101113412010031114231 |
6 | 553050143110131355 |
7 | 30052214412315413 |
oct | 2662246367227567 |
9 | 433744274334438 |
10 | 100215342051191 |
11 | 29a280a6a85524 |
12 | b2a64a3350b5b |
13 | 43bc35cb13303 |
14 | 1aa663c715d43 |
15 | b8bc6eac1c7b |
hex | 5b2533dd2f77 |
100215342051191 has 2 divisors, whose sum is σ = 100215342051192. Its totient is φ = 100215342051190.
The previous prime is 100215342051137. The next prime is 100215342051197. The reversal of 100215342051191 is 191150243512001.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100215342051191 is a prime.
It is a super-2 number, since 2×1002153420511912 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100215342051197) 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, 50107671025595 + 50107671025596.
It is an arithmetic number, because the mean of its divisors is an integer number (50107671025596).
Almost surely, 2100215342051191 is an apocalyptic number.
100215342051191 is a deficient number, since it is larger than the sum of its proper divisors (1).
100215342051191 is an equidigital number, since it uses as much as digits as its factorization.
100215342051191 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 35.
Adding to 100215342051191 its reverse (191150243512001), we get a palindrome (291365585563192).
The spelling of 100215342051191 in words is "one hundred trillion, two hundred fifteen billion, three hundred forty-two million, fifty-one thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •