Base | Representation |
---|---|
bin | 110011010001010011… |
… | …0010000111000001111 |
3 | 101112012012120022102100 |
4 | 1212202212100320033 |
5 | 3300442120400444 |
6 | 122325154330143 |
7 | 10645301411142 |
oct | 1464246207017 |
9 | 345165508370 |
10 | 110102121999 |
11 | 4276a860961 |
12 | 19408b89953 |
13 | a4c870451c |
14 | 54869a8059 |
15 | 2ce606ae69 |
hex | 19a2990e0f |
110102121999 has 48 divisors (see below), whose sum is σ = 167630205600. Its totient is φ = 69561669888.
The previous prime is 110102121977. The next prime is 110102122007. The reversal of 110102121999 is 999121201011.
It is not a de Polignac number, because 110102121999 - 217 = 110101990927 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110102121949) 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 47 ways as a sum of consecutive naturals, for example, 2115817 + ... + 2167229.
It is an arithmetic number, because the mean of its divisors is an integer number (3492295950).
Almost surely, 2110102121999 is an apocalyptic number.
110102121999 is a deficient number, since it is larger than the sum of its proper divisors (57528083601).
110102121999 is a wasteful number, since it uses less digits than its factorization.
110102121999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51624 (or 51621 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 36.
The spelling of 110102121999 in words is "one hundred ten billion, one hundred two million, one hundred twenty-one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •