Base | Representation |
---|---|
bin | 10110110000111101000010… |
… | …101110110111101110101001 |
3 | 111010111111001202111201122120 |
4 | 112300331002232313232221 |
5 | 101110341004132021301 |
6 | 552534555511341453 |
7 | 30042340151055516 |
oct | 2660750256675651 |
9 | 433444052451576 |
10 | 100121102220201 |
11 | 299a1137062687 |
12 | b290182681889 |
13 | 43b34c17aa6ca |
14 | 1aa1c5c6b430d |
15 | b895a63e8e36 |
hex | 5b0f42bb7ba9 |
100121102220201 has 8 divisors (see below), whose sum is σ = 133495365372960. Its totient is φ = 66747120273792.
The previous prime is 100121102220131. The next prime is 100121102220203. The reversal of 100121102220201 is 102022201121001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100121102220201 - 213 = 100121102212009 is a prime.
It is a super-2 number, since 2×1001211022202012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100121102220203) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69469416 + ... + 70895993.
It is an arithmetic number, because the mean of its divisors is an integer number (16686920671620).
Almost surely, 2100121102220201 is an apocalyptic number.
It is an amenable number.
100121102220201 is a deficient number, since it is larger than the sum of its proper divisors (33374263152759).
100121102220201 is a wasteful number, since it uses less digits than its factorization.
100121102220201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140603175.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 100121102220201 its reverse (102022201121001), we get a palindrome (202143303341202).
The spelling of 100121102220201 in words is "one hundred trillion, one hundred twenty-one billion, one hundred two million, two hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •