Base | Representation |
---|---|
bin | 10110101111001101010011… |
… | …010011001110100010111011 |
3 | 111010002000101001212102010102 |
4 | 112233031103103032202323 |
5 | 101101404244000231021 |
6 | 552403514131510015 |
7 | 30030562001304233 |
oct | 2657152323164273 |
9 | 433060331772112 |
10 | 100001121102011 |
11 | 29955267924768 |
12 | b270a7915830b |
13 | 43a50b04a480c |
14 | 1a9a119a84cc3 |
15 | b863d2e2300b |
hex | 5af3534ce8bb |
100001121102011 has 8 divisors (see below), whose sum is σ = 103451019066480. Its totient is φ = 96551328700512.
The previous prime is 100001121101989. The next prime is 100001121102097. The reversal of 100001121102011 is 110201121100001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100001121102011 - 226 = 100001053993147 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100001121101983 and 100001121102001.
It is not an unprimeable number, because it can be changed into a prime (100001121122011) 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, 24461045 + ... + 28254998.
It is an arithmetic number, because the mean of its divisors is an integer number (12931377383310).
Almost surely, 2100001121102011 is an apocalyptic number.
100001121102011 is a deficient number, since it is larger than the sum of its proper divisors (3449897964469).
100001121102011 is an equidigital number, since it uses as much as digits as its factorization.
100001121102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52781485.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 100001121102011 its reverse (110201121100001), we get a palindrome (210202242202012).
The spelling of 100001121102011 in words is "one hundred trillion, one billion, one hundred twenty-one million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •