Base | Representation |
---|---|
bin | 110011010001111010… |
… | …1111110111101010001 |
3 | 101112020122220001020120 |
4 | 1212203311332331101 |
5 | 3301012443120423 |
6 | 122331222300453 |
7 | 10645644140451 |
oct | 1464365767521 |
9 | 345218801216 |
10 | 110123020113 |
11 | 42780634a27 |
12 | 19413b87729 |
13 | a4ccb40682 |
14 | 5489687d61 |
15 | 2ce7ce7ee3 |
hex | 19a3d7ef51 |
110123020113 has 32 divisors (see below), whose sum is σ = 156039989760. Its totient is φ = 68885671680.
The previous prime is 110123020093. The next prime is 110123020141. The reversal of 110123020113 is 311020321011.
It is a happy number.
It is not a de Polignac number, because 110123020113 - 216 = 110122954577 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 110123020092 and 110123020101.
It is not an unprimeable number, because it can be changed into a prime (110123120113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10113370 + ... + 10124252.
It is an arithmetic number, because the mean of its divisors is an integer number (4876249680).
Almost surely, 2110123020113 is an apocalyptic number.
It is an amenable number.
110123020113 is a deficient number, since it is larger than the sum of its proper divisors (45916969647).
110123020113 is a wasteful number, since it uses less digits than its factorization.
110123020113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12589.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 110123020113 its reverse (311020321011), we get a palindrome (421143341124).
The spelling of 110123020113 in words is "one hundred ten billion, one hundred twenty-three million, twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •