Base | Representation |
---|---|
bin | 10110101111001101010011… |
… | …010011100110100001010011 |
3 | 111010002000101002001101211110 |
4 | 112233031103103212201103 |
5 | 101101404244011401321 |
6 | 552403514133544403 |
7 | 30030562002163440 |
oct | 2657152323464123 |
9 | 433060332041743 |
10 | 100001121200211 |
11 | 29955267991520 |
12 | b270a791a5103 |
13 | 43a50b050a41a |
14 | 1a9a119aac9c7 |
15 | b863d2e42176 |
hex | 5af3534e6853 |
100001121200211 has 64 divisors (see below), whose sum is σ = 167245831766016. Its totient is φ = 51633123484800.
The previous prime is 100001121200137. The next prime is 100001121200221. The reversal of 100001121200211 is 112002121100001.
It is not a de Polignac number, because 100001121200211 - 221 = 100001119103059 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100001121200221) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 135786706 + ... + 136521176.
It is an arithmetic number, because the mean of its divisors is an integer number (2613216121344).
Almost surely, 2100001121200211 is an apocalyptic number.
100001121200211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100001121200211 is a deficient number, since it is larger than the sum of its proper divisors (67244710565805).
100001121200211 is a wasteful number, since it uses less digits than its factorization.
100001121200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 738072.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 100001121200211 its reverse (112002121100001), we get a palindrome (212003242300212).
It can be divided in two parts, 1000011 and 21200211, that added together give a palindrome (22200222).
The spelling of 100001121200211 in words is "one hundred trillion, one billion, one hundred twenty-one million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •