Base | Representation |
---|---|
bin | 11001000011101000101100… |
… | …000011111110100110010101 |
3 | 112110012010001212112221021102 |
4 | 121003220230003332212111 |
5 | 103421013132042333414 |
6 | 1030213351204155445 |
7 | 32132521522410215 |
oct | 3103505403764625 |
9 | 473163055487242 |
10 | 110201010121109 |
11 | 32127a93308326 |
12 | 1043983b398b85 |
13 | 4964bab96251b |
14 | 1d2da86246245 |
15 | cb18ab6b6ede |
hex | 643a2c0fe995 |
110201010121109 has 8 divisors (see below), whose sum is σ = 115514161490112. Its totient is φ = 105012874078560.
The previous prime is 110201010121057. The next prime is 110201010121303. The reversal of 110201010121109 is 901121010102011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110201010121109 - 28 = 110201010120853 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110201010321109) 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 7 ways as a sum of consecutive naturals, for example, 31253829809 + ... + 31253833334.
It is an arithmetic number, because the mean of its divisors is an integer number (14439270186264).
Almost surely, 2110201010121109 is an apocalyptic number.
It is an amenable number.
110201010121109 is a deficient number, since it is larger than the sum of its proper divisors (5313151369003).
110201010121109 is an equidigital number, since it uses as much as digits as its factorization.
110201010121109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62507663227.
The product of its (nonzero) digits is 36, while the sum is 20.
The spelling of 110201010121109 in words is "one hundred ten trillion, two hundred one billion, ten million, one hundred twenty-one thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •