Base | Representation |
---|---|
bin | 10110110000110010110100… |
… | …001001000100010111001011 |
3 | 111010110102201101112201002110 |
4 | 112300302310021010113023 |
5 | 101110201011210324321 |
6 | 552525542040433403 |
7 | 30041501045611512 |
oct | 2660626411042713 |
9 | 433412641481073 |
10 | 100110120011211 |
11 | 29997510976502 |
12 | b28a018778863 |
13 | 43b2461471bab |
14 | 1aa14d9d15679 |
15 | b891621c1176 |
hex | 5b0cb42445cb |
100110120011211 has 8 divisors (see below), whose sum is σ = 133883423339584. Its totient is φ = 66538448345160.
The previous prime is 100110120011191. The next prime is 100110120011221. The reversal of 100110120011211 is 112110021011001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100110120011211 - 29 = 100110120010699 is a prime.
It is a super-2 number, since 2×1001101200112112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100110120011221) 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, 50407914421 + ... + 50407916406.
It is an arithmetic number, because the mean of its divisors is an integer number (16735427917448).
Almost surely, 2100110120011211 is an apocalyptic number.
100110120011211 is a deficient number, since it is larger than the sum of its proper divisors (33773303328373).
100110120011211 is a wasteful number, since it uses less digits than its factorization.
100110120011211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100815831161.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 100110120011211 its reverse (112110021011001), we get a palindrome (212220141022212).
The spelling of 100110120011211 in words is "one hundred trillion, one hundred ten billion, one hundred twenty million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •