Base | Representation |
---|---|
bin | 10110110000110100100100… |
… | …111010110111000101001001 |
3 | 111010110121121020212101200220 |
4 | 112300310210322313011021 |
5 | 101110213400100042301 |
6 | 552530453511020253 |
7 | 30041565662322105 |
oct | 2660644472670511 |
9 | 433417536771626 |
10 | 100112012112201 |
11 | 299982a1a16a31 |
12 | b28a46636a689 |
13 | 43b26a346b28b |
14 | 1aa1639324905 |
15 | b8922336d936 |
hex | 5b0d24eb7149 |
100112012112201 has 24 divisors (see below), whose sum is σ = 143912848633440. Its totient is φ = 61877837125632.
The previous prime is 100112012112163. The next prime is 100112012112241. The reversal of 100112012112201 is 102211210211001.
It is a happy number.
It is not a de Polignac number, because 100112012112201 - 211 = 100112012110153 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100112012112241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 861654216 + ... + 861770393.
It is an arithmetic number, because the mean of its divisors is an integer number (5996368693060).
Almost surely, 2100112012112201 is an apocalyptic number.
It is an amenable number.
100112012112201 is a deficient number, since it is larger than the sum of its proper divisors (43800836521239).
100112012112201 is a wasteful number, since it uses less digits than its factorization.
100112012112201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1723424713 (or 1723424696 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 100112012112201 its reverse (102211210211001), we get a palindrome (202323222323202).
The spelling of 100112012112201 in words is "one hundred trillion, one hundred twelve billion, twelve million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •