Base | Representation |
---|---|
bin | 1010000111011001111101… |
… | …1000111100011011101111 |
3 | 1110101021201022022110200022 |
4 | 2201312133120330123233 |
5 | 2424212030134230204 |
6 | 35353311241352355 |
7 | 2225364030622325 |
oct | 241663730743357 |
9 | 43337638273608 |
10 | 11122344445679 |
11 | 35a8a61531845 |
12 | 12b77027986bb |
13 | 628aa924578c |
14 | 2a6477dd9d15 |
15 | 1444b73b05be |
hex | a1d9f63c6ef |
11122344445679 has 16 divisors (see below), whose sum is σ = 11292131203200. Its totient is φ = 10953561636864.
The previous prime is 11122344445673. The next prime is 11122344445691. The reversal of 11122344445679 is 97654444322111.
It is a cyclic number.
It is not a de Polignac number, because 11122344445679 - 28 = 11122344445423 is a prime.
It is a super-3 number, since 3×111223444456793 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a plaindrome in base 10.
It is a self number, because there is not a number n which added to its sum of digits gives 11122344445679.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11122344445673) 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, 398365082 + ... + 398393000.
It is an arithmetic number, because the mean of its divisors is an integer number (705758200200).
Almost surely, 211122344445679 is an apocalyptic number.
11122344445679 is a deficient number, since it is larger than the sum of its proper divisors (169786757521).
11122344445679 is a wasteful number, since it uses less digits than its factorization.
11122344445679 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45682.
The product of its digits is 5806080, while the sum is 53.
The spelling of 11122344445679 in words is "eleven trillion, one hundred twenty-two billion, three hundred forty-four million, four hundred forty-five thousand, six hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •