Base | Representation |
---|---|
bin | 110011010001001111… |
… | …0100101101011000101 |
3 | 101112012001210002111122 |
4 | 1212202132211223011 |
5 | 3300441112010041 |
6 | 122325043243325 |
7 | 10645245331256 |
oct | 1464236455305 |
9 | 345161702448 |
10 | 110100110021 |
11 | 42769707270 |
12 | 19408379545 |
13 | a4c817b7c5 |
14 | 5486602b2d |
15 | 2ce5cbec4b |
hex | 19a27a5ac5 |
110100110021 has 16 divisors (see below), whose sum is σ = 121565283840. Its totient is φ = 98882263920.
The previous prime is 110100109991. The next prime is 110100110039. The reversal of 110100110021 is 120011001011.
It is a happy number.
It is not a de Polignac number, because 110100110021 - 218 = 110099847877 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110100109990 and 110100110008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110100110221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 358766 + ... + 590688.
It is an arithmetic number, because the mean of its divisors is an integer number (7597830240).
Almost surely, 2110100110021 is an apocalyptic number.
110100110021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
110100110021 is a deficient number, since it is larger than the sum of its proper divisors (11465173819).
110100110021 is a wasteful number, since it uses less digits than its factorization.
110100110021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232456.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 110100110021 its reverse (120011001011), we get a palindrome (230111111032).
The spelling of 110100110021 in words is "one hundred ten billion, one hundred million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •