Base | Representation |
---|---|
bin | 10000010101111001110… |
… | …101101011101001111111 |
3 | 10222100201221011102222020 |
4 | 100111321311223221333 |
5 | 121344431312023324 |
6 | 2215525122451223 |
7 | 144064513266120 |
oct | 20257165535177 |
9 | 3870657142866 |
10 | 1123030579839 |
11 | 3a3302537553 |
12 | 161798803b13 |
13 | 81b942b32cc |
14 | 3c4d8076047 |
15 | 1e32c801679 |
hex | 10579d6ba7f |
1123030579839 has 16 divisors (see below), whose sum is σ = 1727899110912. Its totient is φ = 635501353248.
The previous prime is 1123030579829. The next prime is 1123030579849. The reversal of 1123030579839 is 9389750303211.
It is an interprime number because it is at equal distance from previous prime (1123030579829) and next prime (1123030579849).
It is not a de Polignac number, because 1123030579839 - 24 = 1123030579823 is a prime.
It is a super-2 number, since 2×11230305798392 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1123030579791 and 1123030579800.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123030579829) 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, 259598064 + ... + 259602389.
It is an arithmetic number, because the mean of its divisors is an integer number (107993694432).
Almost surely, 21123030579839 is an apocalyptic number.
1123030579839 is a deficient number, since it is larger than the sum of its proper divisors (604868531073).
1123030579839 is a wasteful number, since it uses less digits than its factorization.
1123030579839 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 519200566.
The product of its (nonzero) digits is 1224720, while the sum is 51.
The spelling of 1123030579839 in words is "one trillion, one hundred twenty-three billion, thirty million, five hundred seventy-nine thousand, eight hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •