Base | Representation |
---|---|
bin | 110011010001010011… |
… | …0001011100010011001 |
3 | 101112012012112012102001 |
4 | 1212202212023202121 |
5 | 3300442114200441 |
6 | 122325154041001 |
7 | 10645301260306 |
oct | 1464246134231 |
9 | 345165465361 |
10 | 110102100121 |
11 | 4276a846482 |
12 | 19408b79161 |
13 | a4c86c7590 |
14 | 54869a00ad |
15 | 2ce6064731 |
hex | 19a298b899 |
110102100121 has 16 divisors (see below), whose sum is σ = 120560287120. Its totient is φ = 99929272320.
The previous prime is 110102100083. The next prime is 110102100127. The reversal of 110102100121 is 121001201011.
It can be written as a sum of positive squares in 8 ways, for example, as 69886209600 + 40215890521 = 264360^2 + 200539^2 .
It is a cyclic number.
It is not a de Polignac number, because 110102100121 - 219 = 110101575833 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110102100098 and 110102100107.
It is not an unprimeable number, because it can be changed into a prime (110102100127) 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 15 ways as a sum of consecutive naturals, for example, 2222065 + ... + 2271073.
It is an arithmetic number, because the mean of its divisors is an integer number (7535017945).
Almost surely, 2110102100121 is an apocalyptic number.
It is an amenable number.
110102100121 is a deficient number, since it is larger than the sum of its proper divisors (10458186999).
110102100121 is a wasteful number, since it uses less digits than its factorization.
110102100121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51916.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 110102100121 its reverse (121001201011), we get a palindrome (231103301132).
The spelling of 110102100121 in words is "one hundred ten billion, one hundred two million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •