Base | Representation |
---|---|
bin | 101110100100010000… |
… | …1100101010110110001 |
3 | 100120010020112201020122 |
4 | 1131020201211112301 |
5 | 3114300224323441 |
6 | 113535000420025 |
7 | 10140055366244 |
oct | 1351041452661 |
9 | 316106481218 |
10 | 100001011121 |
11 | 39456a66840 |
12 | 1746a177615 |
13 | 9578aa4a3b |
14 | 4ba924525b |
15 | 290438934b |
hex | 17488655b1 |
100001011121 has 16 divisors (see below), whose sum is σ = 111183019200. Its totient is φ = 89184024000.
The previous prime is 100001011093. The next prime is 100001011129. The reversal of 100001011121 is 121110100001.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100001011121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100001011099 and 100001011108.
It is not an unprimeable number, because it can be changed into a prime (100001011129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 291791 + ... + 533988.
It is an arithmetic number, because the mean of its divisors is an integer number (6948938700).
Almost surely, 2100001011121 is an apocalyptic number.
100001011121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100001011121 is a deficient number, since it is larger than the sum of its proper divisors (11182008079).
100001011121 is a wasteful number, since it uses less digits than its factorization.
100001011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 826000.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 100001011121 its reverse (121110100001), we get a palindrome (221111111122).
The spelling of 100001011121 in words is "one hundred billion, one million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •