Base | Representation |
---|---|
bin | 11001000000111000101010… |
… | …001111110010100100011111 |
3 | 112102112001012111201221021110 |
4 | 121000320222033302210133 |
5 | 103404414034240231421 |
6 | 1025550452101033103 |
7 | 32113050641303463 |
oct | 3100705217624437 |
9 | 472461174657243 |
10 | 110012001102111 |
11 | 320649116848a9 |
12 | 104090906b5793 |
13 | 4950119730804 |
14 | 1d24875b684a3 |
15 | cab9e80eea76 |
hex | 640e2a3f291f |
110012001102111 has 8 divisors (see below), whose sum is σ = 149803575969024. Its totient is φ = 71780880151640.
The previous prime is 110012001102043. The next prime is 110012001102119. The reversal of 110012001102111 is 111201100210011.
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 110012001102111 - 215 = 110012001069343 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110012001102119) 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, 390113478945 + ... + 390113479226.
It is an arithmetic number, because the mean of its divisors is an integer number (18725446996128).
Almost surely, 2110012001102111 is an apocalyptic number.
110012001102111 is a deficient number, since it is larger than the sum of its proper divisors (39791574866913).
110012001102111 is an equidigital number, since it uses as much as digits as its factorization.
110012001102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 780226958221.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 110012001102111 its reverse (111201100210011), we get a palindrome (221213101312122).
The spelling of 110012001102111 in words is "one hundred ten trillion, twelve billion, one million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •