Base | Representation |
---|---|
bin | 110011010100100000… |
… | …1110100111111110001 |
3 | 101112110201120122110202 |
4 | 1212221001310333301 |
5 | 3301202230323441 |
6 | 122344011004545 |
7 | 10651051431530 |
oct | 1465101647761 |
9 | 345421518422 |
10 | 110210011121 |
11 | 42815750621 |
12 | 19439139755 |
13 | a514b7ab42 |
14 | 5497050317 |
15 | 2d0077d19b |
hex | 19a9074ff1 |
110210011121 has 4 divisors (see below), whose sum is σ = 125954298432. Its totient is φ = 94465723812.
The previous prime is 110210011103. The next prime is 110210011123. The reversal of 110210011121 is 121110012011.
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, and also an emirpimes, since its reverse is a distinct semiprime: 121110012011 = 31 ⋅3906774581.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110210011121 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (110210011123) 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, 7872143645 + ... + 7872143658.
It is an arithmetic number, because the mean of its divisors is an integer number (31488574608).
Almost surely, 2110210011121 is an apocalyptic number.
It is an amenable number.
110210011121 is a deficient number, since it is larger than the sum of its proper divisors (15744287311).
110210011121 is an equidigital number, since it uses as much as digits as its factorization.
110210011121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15744287310.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 110210011121 its reverse (121110012011), we get a palindrome (231320023132).
The spelling of 110210011121 in words is "one hundred ten billion, two hundred ten million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •