Base | Representation |
---|---|
bin | 1001001001010010011011… |
… | …11011111100110100010111 |
3 | 2122012112022110222220102000 |
4 | 10210221031323330310113 |
5 | 10113441441134103421 |
6 | 110434321550250343 |
7 | 4143632040214551 |
oct | 444511573746427 |
9 | 78175273886360 |
10 | 20110344441111 |
11 | 6453827185921 |
12 | 23096297b69b3 |
13 | b2b521c6b842 |
14 | 4d74bb0a24d1 |
15 | 24d1b231a226 |
hex | 124a4defcd17 |
20110344441111 has 16 divisors (see below), whose sum is σ = 29793190590720. Its totient is φ = 13406856822360.
The previous prime is 20110344441067. The next prime is 20110344441133. The reversal of 20110344441111 is 11114444301102.
20110344441111 is a `hidden beast` number, since 2 + 0 + 1 + 103 + 4 + 4 + 441 + 111 = 666.
It is not a de Polignac number, because 20110344441111 - 27 = 20110344440983 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20110344441191) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10458046 + ... + 12230756.
It is an arithmetic number, because the mean of its divisors is an integer number (1862074411920).
Almost surely, 220110344441111 is an apocalyptic number.
20110344441111 is a deficient number, since it is larger than the sum of its proper divisors (9682846149609).
20110344441111 is a wasteful number, since it uses less digits than its factorization.
20110344441111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2192883 (or 2192877 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
Adding to 20110344441111 its reverse (11114444301102), we get a palindrome (31224788742213).
The spelling of 20110344441111 in words is "twenty trillion, one hundred ten billion, three hundred forty-four million, four hundred forty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •