Base | Representation |
---|---|
bin | 11001000000101110011011… |
… | …001100101011101101011110 |
3 | 112102110222211121022121222010 |
4 | 121000232123030223231132 |
5 | 103404224032332223402 |
6 | 1025541433353332050 |
7 | 32112211413623064 |
oct | 3100563314535536 |
9 | 472428747277863 |
10 | 110001011211102 |
11 | 32060192121050 |
12 | 10406b24107026 |
13 | 494c08793551b |
14 | 1d2411236a034 |
15 | cab5a33aaa6c |
hex | 640b9b32bb5e |
110001011211102 has 64 divisors (see below), whose sum is σ = 240238358680320. Its totient is φ = 33300844972800.
The previous prime is 110001011211089. The next prime is 110001011211109. The reversal of 110001011211102 is 201112110100011.
It is a super-3 number, since 3×1100010112111023 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110001011211109) 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, 1297001674 + ... + 1297086482.
It is an arithmetic number, because the mean of its divisors is an integer number (3753724354380).
Almost surely, 2110001011211102 is an apocalyptic number.
110001011211102 is an abundant number, since it is smaller than the sum of its proper divisors (130237347469218).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110001011211102 is a wasteful number, since it uses less digits than its factorization.
110001011211102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103929.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 110001011211102 its reverse (201112110100011), we get a palindrome (311113121311113).
The spelling of 110001011211102 in words is "one hundred ten trillion, one billion, eleven million, two hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •