Base | Representation |
---|---|
bin | 10010000110100111001… |
… | …010000101010000101101 |
3 | 11101221002222112021122211 |
4 | 102012213022011100231 |
5 | 130340303244032410 |
6 | 2351301512410421 |
7 | 155610501260656 |
oct | 22064712052055 |
9 | 4357088467584 |
10 | 1244049986605 |
11 | 43a66486aaa8 |
12 | 1811319a6a11 |
13 | 9040c740c3a |
14 | 442d893c52d |
15 | 2256201d68a |
hex | 121a728542d |
1244049986605 has 32 divisors (see below), whose sum is σ = 1515001644000. Its totient is φ = 980615580672.
The previous prime is 1244049986483. The next prime is 1244049986639. The reversal of 1244049986605 is 5066899404421.
It is a happy number.
It can be written as a sum of positive squares in 16 ways, for example, as 699881154921 + 544168831684 = 836589^2 + 737678^2 .
It is a cyclic number.
It is not a de Polignac number, because 1244049986605 - 211 = 1244049984557 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1244049986605.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 52816371 + ... + 52839919.
It is an arithmetic number, because the mean of its divisors is an integer number (47343801375).
Almost surely, 21244049986605 is an apocalyptic number.
It is an amenable number.
1244049986605 is a deficient number, since it is larger than the sum of its proper divisors (270951657395).
1244049986605 is a wasteful number, since it uses less digits than its factorization.
1244049986605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24273.
The product of its (nonzero) digits is 14929920, while the sum is 58.
The spelling of 1244049986605 in words is "one trillion, two hundred forty-four billion, forty-nine million, nine hundred eighty-six thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •