Base | Representation |
---|---|
bin | 10110110000101011010110… |
… | …110001001010000110001011 |
3 | 111010102200001020012100111211 |
4 | 112300223112301022012023 |
5 | 101110033110404324321 |
6 | 552522135220033551 |
7 | 30041065425335341 |
oct | 2660532661120613 |
9 | 433380036170454 |
10 | 100102111011211 |
11 | 29994081011241 |
12 | b2885625328b7 |
13 | 43b17860ca43a |
14 | 1aa0d7a387991 |
15 | b88d43ee90e1 |
hex | 5b0ad6c4a18b |
100102111011211 has 4 divisors (see below), whose sum is σ = 100102721118912. Its totient is φ = 100101500903512.
The previous prime is 100102111011137. The next prime is 100102111011223. The reversal of 100102111011211 is 112110111201001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100102111011211 - 213 = 100102111003019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100102111011191 and 100102111011200.
It is not an unprimeable number, because it can be changed into a prime (100102111011271) 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, 304807675 + ... + 305135908.
It is an arithmetic number, because the mean of its divisors is an integer number (25025680279728).
Almost surely, 2100102111011211 is an apocalyptic number.
100102111011211 is a deficient number, since it is larger than the sum of its proper divisors (610107701).
100102111011211 is an equidigital number, since it uses as much as digits as its factorization.
100102111011211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 610107700.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 100102111011211 its reverse (112110111201001), we get a palindrome (212212222212212).
The spelling of 100102111011211 in words is "one hundred trillion, one hundred two billion, one hundred eleven million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •