Base | Representation |
---|---|
bin | 110011001110010010… |
… | …0111100100000100011 |
3 | 101111221011111112021212 |
4 | 1212130210330200203 |
5 | 3300240241104443 |
6 | 122311145340335 |
7 | 10642634014466 |
oct | 1463444744043 |
9 | 344834445255 |
10 | 110001113123 |
11 | 42718840450 |
12 | 1939b1976ab |
13 | a4b07c9765 |
14 | 54773d32dd |
15 | 2cdc267618 |
hex | 199c93c823 |
110001113123 has 4 divisors (see below), whose sum is σ = 120001214328. Its totient is φ = 100001011920.
The previous prime is 110001113063. The next prime is 110001113161. The reversal of 110001113123 is 321311100011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110001113123 - 26 = 110001113059 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110001113098 and 110001113107.
It is not an unprimeable number, because it can be changed into a prime (110001115123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5000050586 + ... + 5000050607.
It is an arithmetic number, because the mean of its divisors is an integer number (30000303582).
Almost surely, 2110001113123 is an apocalyptic number.
110001113123 is a deficient number, since it is larger than the sum of its proper divisors (10000101205).
110001113123 is a wasteful number, since it uses less digits than its factorization.
110001113123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10000101204.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 110001113123 its reverse (321311100011), we get a palindrome (431312213134).
The spelling of 110001113123 in words is "one hundred ten billion, one million, one hundred thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •