Base | Representation |
---|---|
bin | 10000010111000000000… |
… | …100110001000000011101 |
3 | 10222110210001110021220111 |
4 | 100113000010301000131 |
5 | 121404334442022122 |
6 | 2220242055050021 |
7 | 144135642212512 |
oct | 20270004610035 |
9 | 3873701407814 |
10 | 1124208939037 |
11 | 3a3857702228 |
12 | 161a67370911 |
13 | 8202146b582 |
14 | 3c5aa771309 |
15 | 1e39aeb4d77 |
hex | 105c013101d |
1124208939037 has 2 divisors, whose sum is σ = 1124208939038. Its totient is φ = 1124208939036.
The previous prime is 1124208939017. The next prime is 1124208939041. The reversal of 1124208939037 is 7309398024211.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1048506369156 + 75702569881 = 1023966^2 + 275141^2 .
It is a cyclic number.
It is not a de Polignac number, because 1124208939037 - 239 = 574453125149 is a prime.
It is a super-2 number, since 2×11242089390372 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1124208939017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 562104469518 + 562104469519.
It is an arithmetic number, because the mean of its divisors is an integer number (562104469519).
Almost surely, 21124208939037 is an apocalyptic number.
It is an amenable number.
1124208939037 is a deficient number, since it is larger than the sum of its proper divisors (1).
1124208939037 is an equidigital number, since it uses as much as digits as its factorization.
1124208939037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 653184, while the sum is 49.
The spelling of 1124208939037 in words is "one trillion, one hundred twenty-four billion, two hundred eight million, nine hundred thirty-nine thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •