Base | Representation |
---|---|
bin | 11001000000111000110000… |
… | …001001110111000100111001 |
3 | 112102112001110102020012010002 |
4 | 121000320300021313010321 |
5 | 103404414240123223001 |
6 | 1025550510001202345 |
7 | 32113053253564622 |
oct | 3100706011670471 |
9 | 472461412205102 |
10 | 110012100211001 |
11 | 3206496261787a |
12 | 104090b99303b5 |
13 | 4950134121821 |
14 | 1d24884da6a49 |
15 | caba01b7a46b |
hex | 640e30277139 |
110012100211001 has 4 divisors (see below), whose sum is σ = 111404658441600. Its totient is φ = 108619541980404.
The previous prime is 110012100210989. The next prime is 110012100211003. The reversal of 110012100211001 is 100112001210011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 110012100211001 - 230 = 110011026469177 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (110012100211003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 696279115181 + ... + 696279115338.
It is an arithmetic number, because the mean of its divisors is an integer number (27851164610400).
Almost surely, 2110012100211001 is an apocalyptic number.
It is an amenable number.
110012100211001 is a deficient number, since it is larger than the sum of its proper divisors (1392558230599).
110012100211001 is an equidigital number, since it uses as much as digits as its factorization.
110012100211001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1392558230598.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 110012100211001 its reverse (100112001210011), we get a palindrome (210124101421012).
The spelling of 110012100211001 in words is "one hundred ten trillion, twelve billion, one hundred million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •