Base | Representation |
---|---|
bin | 11001000010010011111011… |
… | …100000000111010110110011 |
3 | 112102212102011022000122200201 |
4 | 121002103323200013112303 |
5 | 103413020240240201321 |
6 | 1030103500341100031 |
7 | 32123120321451610 |
oct | 3102237340072663 |
9 | 472772138018621 |
10 | 110110001100211 |
11 | 320a2431071972 |
12 | 104240806b7617 |
13 | 4959436a95078 |
14 | 1d294d132d507 |
15 | cae331976291 |
hex | 6424fb8075b3 |
110110001100211 has 8 divisors (see below), whose sum is σ = 125840527560800. Its totient is φ = 94379606215488.
The previous prime is 110110001100173. The next prime is 110110001100217. The reversal of 110110001100211 is 112001100011011.
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 110110001100211 - 213 = 110110001092019 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110110001100217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31094136 + ... + 34453813.
It is an arithmetic number, because the mean of its divisors is an integer number (15730065945100).
Almost surely, 2110110001100211 is an apocalyptic number.
110110001100211 is a deficient number, since it is larger than the sum of its proper divisors (15730526460589).
110110001100211 is an equidigital number, since it uses as much as digits as its factorization.
110110001100211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65787933.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 110110001100211 its reverse (112001100011011), we get a palindrome (222111101111222).
The spelling of 110110001100211 in words is "one hundred ten trillion, one hundred ten billion, one million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •