Base | Representation |
---|---|
bin | 1110001101011011110… |
… | …0011010110000011101 |
3 | 212100010102222221120021 |
4 | 3203112330122300131 |
5 | 12444431312043122 |
6 | 304052115352141 |
7 | 23431425401356 |
oct | 3432674326035 |
9 | 770112887507 |
10 | 244124331037 |
11 | 94594903194 |
12 | 3b3908b2651 |
13 | 1a0369a54b2 |
14 | bb5c328d2d |
15 | 653c0901c7 |
hex | 38d6f1ac1d |
244124331037 has 2 divisors, whose sum is σ = 244124331038. Its totient is φ = 244124331036.
The previous prime is 244124331013. The next prime is 244124331091. The reversal of 244124331037 is 730133421442.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 241283334436 + 2840996601 = 491206^2 + 53301^2 .
It is a cyclic number.
It is not a de Polignac number, because 244124331037 - 27 = 244124330909 is a prime.
It is a super-2 number, since 2×2441243310372 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 244124330993 and 244124331011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (244124331007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122062165518 + 122062165519.
It is an arithmetic number, because the mean of its divisors is an integer number (122062165519).
Almost surely, 2244124331037 is an apocalyptic number.
It is an amenable number.
244124331037 is a deficient number, since it is larger than the sum of its proper divisors (1).
244124331037 is an equidigital number, since it uses as much as digits as its factorization.
244124331037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48384, while the sum is 34.
Adding to 244124331037 its reverse (730133421442), we get a palindrome (974257752479).
The spelling of 244124331037 in words is "two hundred forty-four billion, one hundred twenty-four million, three hundred thirty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •