Base | Representation |
---|---|
bin | 11001000000110110110100… |
… | …001110101011101010110011 |
3 | 112102111212002112000102021202 |
4 | 121000312310032223222303 |
5 | 103404401010400201321 |
6 | 1025545523410441415 |
7 | 32112650606462261 |
oct | 3100666416535263 |
9 | 472455075012252 |
10 | 110010021100211 |
11 | 32063a95a570a1 |
12 | 1040881959326b |
13 | 494cb92468a5b |
14 | 1d24728bd7431 |
15 | cab92e38c70b |
hex | 640db43abab3 |
110010021100211 has 4 divisors (see below), whose sum is σ = 112350659847072. Its totient is φ = 107669382353352.
The previous prime is 110010021100163. The next prime is 110010021100229. The reversal of 110010021100211 is 112001120010011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110010021100211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110010021100192 and 110010021100201.
It is not an unprimeable number, because it can be changed into a prime (110010021100411) 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, 1170319373360 + ... + 1170319373453.
It is an arithmetic number, because the mean of its divisors is an integer number (28087664961768).
Almost surely, 2110010021100211 is an apocalyptic number.
110010021100211 is a deficient number, since it is larger than the sum of its proper divisors (2340638746861).
110010021100211 is an equidigital number, since it uses as much as digits as its factorization.
110010021100211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2340638746860.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 110010021100211 its reverse (112001120010011), we get a palindrome (222011141110222).
The spelling of 110010021100211 in words is "one hundred ten trillion, ten billion, twenty-one million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •