Base | Representation |
---|---|
bin | 110011010001110101… |
… | …0011110001010100011 |
3 | 101112020110012201110102 |
4 | 1212203222132022203 |
5 | 3301011210032321 |
6 | 122331033453015 |
7 | 10645606401062 |
oct | 1464352361243 |
9 | 345213181412 |
10 | 110120002211 |
11 | 4277996359a |
12 | 19412b7116b |
13 | a4cc324b2b |
14 | 54891001d9 |
15 | 2ce78edc0b |
hex | 19a3a9e2a3 |
110120002211 has 4 divisors (see below), whose sum is σ = 110120674752. Its totient is φ = 110119329672.
The previous prime is 110120002199. The next prime is 110120002217. The reversal of 110120002211 is 112200021011.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 110120002211 - 226 = 110052893347 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110120002192 and 110120002201.
It is not an unprimeable number, because it can be changed into a prime (110120002217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 86561 + ... + 477213.
It is an arithmetic number, because the mean of its divisors is an integer number (27530168688).
Almost surely, 2110120002211 is an apocalyptic number.
110120002211 is a deficient number, since it is larger than the sum of its proper divisors (672541).
110120002211 is an equidigital number, since it uses as much as digits as its factorization.
110120002211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 672540.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110120002211 its reverse (112200021011), we get a palindrome (222320023222).
The spelling of 110120002211 in words is "one hundred ten billion, one hundred twenty million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •