Base | Representation |
---|---|
bin | 110111100000111101011101… |
… | …100011010010101011011101 |
3 | 1012000111020101020011220100012 |
4 | 313200331131203102223131 |
5 | 224000234203301031344 |
6 | 2223140235223413005 |
7 | 102266542220302361 |
oct | 6740753543225335 |
9 | 1160436336156305 |
10 | 244157575408349 |
11 | 70883712163599 |
12 | 23473459bb4165 |
13 | a630c644a2965 |
14 | 444140ad312a1 |
15 | 1d3617392129e |
hex | de0f5d8d2add |
244157575408349 has 2 divisors, whose sum is σ = 244157575408350. Its totient is φ = 244157575408348.
The previous prime is 244157575408339. The next prime is 244157575408379. The reversal of 244157575408349 is 943804575751442.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 145012340999449 + 99145234408900 = 12042107^2 + 9957170^2 .
It is a cyclic number.
It is not a de Polignac number, because 244157575408349 - 228 = 244157306972893 is a prime.
It is a super-2 number, since 2×2441575754083492 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (244157575408339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122078787704174 + 122078787704175.
It is an arithmetic number, because the mean of its divisors is an integer number (122078787704175).
Almost surely, 2244157575408349 is an apocalyptic number.
It is an amenable number.
244157575408349 is a deficient number, since it is larger than the sum of its proper divisors (1).
244157575408349 is an equidigital number, since it uses as much as digits as its factorization.
244157575408349 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 677376000, while the sum is 68.
The spelling of 244157575408349 in words is "two hundred forty-four trillion, one hundred fifty-seven billion, five hundred seventy-five million, four hundred eight thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •