Base | Representation |
---|---|
bin | 11100010010110110110011… |
… | …110100101100111010001111 |
3 | 121022121110020112020011222212 |
4 | 130102312303310230322033 |
5 | 112302320340211412421 |
6 | 1120355242033101035 |
7 | 35132400400600205 |
oct | 3422666364547217 |
9 | 538543215204885 |
10 | 124441104404111 |
11 | 367181a3299390 |
12 | 11b5962a0b777b |
13 | 5458990679441 |
14 | 22a2da56a7075 |
15 | e5beea946e5b |
hex | 712db3d2ce8f |
124441104404111 has 32 divisors (see below), whose sum is σ = 144233741767680. Its totient is φ = 106272930960000.
The previous prime is 124441104404083. The next prime is 124441104404119. The reversal of 124441104404111 is 111404401144421.
It is a cyclic number.
It is not a de Polignac number, because 124441104404111 - 210 = 124441104403087 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 (124441104404119) 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, 774042986 + ... + 774203736.
It is an arithmetic number, because the mean of its divisors is an integer number (4507304430240).
Almost surely, 2124441104404111 is an apocalyptic number.
124441104404111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
124441104404111 is a deficient number, since it is larger than the sum of its proper divisors (19792637363569).
124441104404111 is a wasteful number, since it uses less digits than its factorization.
124441104404111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226415.
The product of its (nonzero) digits is 8192, while the sum is 32.
Adding to 124441104404111 its reverse (111404401144421), we get a palindrome (235845505548532).
The spelling of 124441104404111 in words is "one hundred twenty-four trillion, four hundred forty-one billion, one hundred four million, four hundred four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •