Base | Representation |
---|---|
bin | 110011010001110101… |
… | …1001110111111101101 |
3 | 101112020110120212211012 |
4 | 1212203223032333231 |
5 | 3301011232432341 |
6 | 122331042035005 |
7 | 10645611163151 |
oct | 1464353167755 |
9 | 345213525735 |
10 | 110120202221 |
11 | 42779a8a897 |
12 | 19413048a65 |
13 | a4cc394b93 |
14 | 5489153061 |
15 | 2ce793d0eb |
hex | 19a3acefed |
110120202221 has 4 divisors (see below), whose sum is σ = 110605313472. Its totient is φ = 109635090972.
The previous prime is 110120202211. The next prime is 110120202229. The reversal of 110120202221 is 122202021011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 110120202221 - 222 = 110116007917 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 110120202196 and 110120202205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110120202229) 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, 242555285 + ... + 242555738.
It is an arithmetic number, because the mean of its divisors is an integer number (27651328368).
Almost surely, 2110120202221 is an apocalyptic number.
It is an amenable number.
110120202221 is a deficient number, since it is larger than the sum of its proper divisors (485111251).
110120202221 is an equidigital number, since it uses as much as digits as its factorization.
110120202221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 485111250.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 110120202221 its reverse (122202021011), we get a palindrome (232322223232).
The spelling of 110120202221 in words is "one hundred ten billion, one hundred twenty million, two hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •