Base | Representation |
---|---|
bin | 10110110010000111110101… |
… | …100001010110111011101011 |
3 | 111010210011100122001011022201 |
4 | 112302013311201112323223 |
5 | 101113144442232222422 |
6 | 553035520504001031 |
7 | 30051212244164062 |
oct | 2662076541267353 |
9 | 433704318034281 |
10 | 100201411210987 |
11 | 29a221a8424049 |
12 | b2a3855a60177 |
13 | 43bac4c93a6b8 |
14 | 1aa5aba4c31d9 |
15 | b8b706aa0727 |
hex | 5b21f5856eeb |
100201411210987 has 4 divisors (see below), whose sum is σ = 100203400292296. Its totient is φ = 100199422129680.
The previous prime is 100201411210961. The next prime is 100201411210997. The reversal of 100201411210987 is 789012114102001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100201411210987 is a prime.
It is a super-2 number, since 2×1002014112109872 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100201411210997) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 994465089 + ... + 994565842.
It is an arithmetic number, because the mean of its divisors is an integer number (25050850073074).
Almost surely, 2100201411210987 is an apocalyptic number.
100201411210987 is a deficient number, since it is larger than the sum of its proper divisors (1989081309).
100201411210987 is an equidigital number, since it uses as much as digits as its factorization.
100201411210987 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1989081308.
The product of its (nonzero) digits is 8064, while the sum is 37.
Adding to 100201411210987 its reverse (789012114102001), we get a palindrome (889213525312988).
The spelling of 100201411210987 in words is "one hundred trillion, two hundred one billion, four hundred eleven million, two hundred ten thousand, nine hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •