Base | Representation |
---|---|
bin | 10110101111011111111010… |
… | …110010101001010000011111 |
3 | 111010010220222012101112221222 |
4 | 112233133322302221100133 |
5 | 101102221213404032033 |
6 | 552421021500443555 |
7 | 30032200241534402 |
oct | 2657377262512037 |
9 | 433126865345858 |
10 | 100021111002143 |
11 | 29962795685591 |
12 | b2749178495bb |
13 | 43a6c47a542a6 |
14 | 1a9b09489bd39 |
15 | b86ba2d46598 |
hex | 5af7faca941f |
100021111002143 has 2 divisors, whose sum is σ = 100021111002144. Its totient is φ = 100021111002142.
The previous prime is 100021111002103. The next prime is 100021111002149. The reversal of 100021111002143 is 341200111120001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100021111002143 - 224 = 100021094224927 is a prime.
It is a super-2 number, since 2×1000211110021432 (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 (100021111002149) 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, 50010555501071 + 50010555501072.
It is an arithmetic number, because the mean of its divisors is an integer number (50010555501072).
Almost surely, 2100021111002143 is an apocalyptic number.
100021111002143 is a deficient number, since it is larger than the sum of its proper divisors (1).
100021111002143 is an equidigital number, since it uses as much as digits as its factorization.
100021111002143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 100021111002143 its reverse (341200111120001), we get a palindrome (441221222122144).
The spelling of 100021111002143 in words is "one hundred trillion, twenty-one billion, one hundred eleven million, two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •