Base | Representation |
---|---|
bin | 101111111110100001000110… |
… | …111011110011011010100011 |
3 | 1000200002211002111011022201011 |
4 | 233332201012323303122203 |
5 | 210124043343402300344 |
6 | 2024434020203121351 |
7 | 62305363222013164 |
oct | 5776410673633243 |
9 | 1020084074138634 |
10 | 211004343400099 |
11 | 61261491a83017 |
12 | 1b7ba07b813257 |
13 | 90978164b9762 |
14 | 3a16943d7d76b |
15 | 195da91c01d34 |
hex | bfe846ef36a3 |
211004343400099 has 2 divisors, whose sum is σ = 211004343400100. Its totient is φ = 211004343400098.
The previous prime is 211004343400031. The next prime is 211004343400139. The reversal of 211004343400099 is 990004343400112.
It is an a-pointer prime, because the next prime (211004343400139) can be obtained adding 211004343400099 to its sum of digits (40).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 211004343400099 - 233 = 210995753465507 is a prime.
It is a super-3 number, since 3×2110043434000993 (a number of 44 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (211004343100099) 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, 105502171700049 + 105502171700050.
It is an arithmetic number, because the mean of its divisors is an integer number (105502171700050).
Almost surely, 2211004343400099 is an apocalyptic number.
211004343400099 is a deficient number, since it is larger than the sum of its proper divisors (1).
211004343400099 is an equidigital number, since it uses as much as digits as its factorization.
211004343400099 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 93312, while the sum is 40.
The spelling of 211004343400099 in words is "two hundred eleven trillion, four billion, three hundred forty-three million, four hundred thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •