Base | Representation |
---|---|
bin | 110011010100100000… |
… | …1110111011011111001 |
3 | 101112110201121011011211 |
4 | 1212221001313123321 |
5 | 3301202231133423 |
6 | 122344011123121 |
7 | 10651051502623 |
oct | 1465101673371 |
9 | 345421534154 |
10 | 110210021113 |
11 | 42815758085 |
12 | 194391434a1 |
13 | a514b8255a |
14 | 5497053c13 |
15 | 2d0078110d |
hex | 19a90776f9 |
110210021113 has 4 divisors (see below), whose sum is σ = 116010548560. Its totient is φ = 104409493668.
The previous prime is 110210021093. The next prime is 110210021143. The reversal of 110210021113 is 311120012011.
It is a happy number.
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 110210021113 - 213 = 110210012921 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110210021093 and 110210021102.
It is not an unprimeable number, because it can be changed into a prime (110210021143) 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, 2900263695 + ... + 2900263732.
It is an arithmetic number, because the mean of its divisors is an integer number (29002637140).
Almost surely, 2110210021113 is an apocalyptic number.
It is an amenable number.
110210021113 is a deficient number, since it is larger than the sum of its proper divisors (5800527447).
110210021113 is an equidigital number, since it uses as much as digits as its factorization.
110210021113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5800527446.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 110210021113 its reverse (311120012011), we get a palindrome (421330033124).
The spelling of 110210021113 in words is "one hundred ten billion, two hundred ten million, twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •