Base | Representation |
---|---|
bin | 10110110000111101000011… |
… | …111010101101101011111011 |
3 | 111010111111010010220211100220 |
4 | 112300331003322231223323 |
5 | 101110341024224231021 |
6 | 552535001501431123 |
7 | 30042340512053133 |
oct | 2660750372555373 |
9 | 433444103824326 |
10 | 100121122102011 |
11 | 299a114730212a |
12 | b29018926b4a3 |
13 | 43b34c594c0aa |
14 | 1aa1c611abac3 |
15 | b895a8024cc6 |
hex | 5b0f43eadafb |
100121122102011 has 8 divisors (see below), whose sum is σ = 133495344865104. Its totient is φ = 66747157036800.
The previous prime is 100121122101943. The next prime is 100121122102021. The reversal of 100121122102011 is 110201221121001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100121122102011 - 218 = 100121121839867 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100121122102021) 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 in 7 ways as a sum of consecutive naturals, for example, 63516090 + ... + 65073311.
It is an arithmetic number, because the mean of its divisors is an integer number (16686918108138).
Almost surely, 2100121122102011 is an apocalyptic number.
100121122102011 is a deficient number, since it is larger than the sum of its proper divisors (33374222763093).
100121122102011 is a wasteful number, since it uses less digits than its factorization.
100121122102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128848941.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 100121122102011 its reverse (110201221121001), we get a palindrome (210322343223012).
The spelling of 100121122102011 in words is "one hundred trillion, one hundred twenty-one billion, one hundred twenty-two million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.241 sec. • engine limits •