Base | Representation |
---|---|
bin | 10110110010011001010101… |
… | …011011010100011110111011 |
3 | 111010211221212001200010100202 |
4 | 112302121111123110132323 |
5 | 101114001432212010021 |
6 | 553052305131152415 |
7 | 30052445662166252 |
oct | 2662312533243673 |
9 | 433757761603322 |
10 | 100220200110011 |
11 | 29a2a16a254a73 |
12 | b2a741a2a570b |
13 | 43bc955435127 |
14 | 1aa697d9c9799 |
15 | b8be5633ba0b |
hex | 5b26556d47bb |
100220200110011 has 4 divisors (see below), whose sum is σ = 102111147281952. Its totient is φ = 98329252938072.
The previous prime is 100220200110007. The next prime is 100220200110029. The reversal of 100220200110011 is 110011002022001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100220200110011 - 22 = 100220200110007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100220200109974 and 100220200110001.
It is not an unprimeable number, because it can be changed into a prime (100220209110011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 945473585891 + ... + 945473585996.
It is an arithmetic number, because the mean of its divisors is an integer number (25527786820488).
Almost surely, 2100220200110011 is an apocalyptic number.
100220200110011 is a deficient number, since it is larger than the sum of its proper divisors (1890947171941).
100220200110011 is an equidigital number, since it uses as much as digits as its factorization.
100220200110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1890947171940.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100220200110011 its reverse (110011002022001), we get a palindrome (210231202132012).
The spelling of 100220200110011 in words is "one hundred trillion, two hundred twenty billion, two hundred million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •