Base | Representation |
---|---|
bin | 11001000010001011101000… |
… | …111101100000000111101001 |
3 | 112102211120011222020002202210 |
4 | 121002023220331200013221 |
5 | 103412344023111231441 |
6 | 1030055425213515333 |
7 | 32122353620305062 |
oct | 3102135075400751 |
9 | 472746158202683 |
10 | 110101100102121 |
11 | 320996837502a7 |
12 | 104223b77a2b49 |
13 | 49586489991ab |
14 | 1d28cc9129569 |
15 | cadeb0303616 |
hex | 6422e8f601e9 |
110101100102121 has 32 divisors (see below), whose sum is σ = 152839482163200. Its totient is φ = 70423849952640.
The previous prime is 110101100102027. The next prime is 110101100102177. The reversal of 110101100102121 is 121201001101011.
It is not a de Polignac number, because 110101100102121 - 211 = 110101100100073 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110101100102097 and 110101100102106.
It is not an unprimeable number, because it can be changed into a prime (110101100107121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3371605 + ... + 15217421.
It is an arithmetic number, because the mean of its divisors is an integer number (4776233817600).
Almost surely, 2110101100102121 is an apocalyptic number.
It is an amenable number.
110101100102121 is a deficient number, since it is larger than the sum of its proper divisors (42738382061079).
110101100102121 is a wasteful number, since it uses less digits than its factorization.
110101100102121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11846709.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 110101100102121 its reverse (121201001101011), we get a palindrome (231302101203132).
The spelling of 110101100102121 in words is "one hundred ten trillion, one hundred one billion, one hundred million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •