Base | Representation |
---|---|
bin | 1110001110001000000… |
… | …1001111010000110101 |
3 | 212100121101122020002211 |
4 | 3203202001033100311 |
5 | 13000321344102203 |
6 | 304122354133421 |
7 | 23436142650313 |
oct | 3434201172065 |
9 | 770541566084 |
10 | 244310144053 |
11 | 9467a786268 |
12 | 3b422b81271 |
13 | 1a066333221 |
14 | bb78c970b3 |
15 | 654d545c6d |
hex | 38e204f435 |
244310144053 has 2 divisors, whose sum is σ = 244310144054. Its totient is φ = 244310144052.
The previous prime is 244310144011. The next prime is 244310144077. The reversal of 244310144053 is 350441013442.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 242120091249 + 2190052804 = 492057^2 + 46798^2 .
It is a cyclic number.
It is not a de Polignac number, because 244310144053 - 217 = 244310012981 is a prime.
It is a super-2 number, since 2×2443101440532 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (244310144093) by changing a digit.
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 as a sum of consecutive naturals, namely, 122155072026 + 122155072027.
It is an arithmetic number, because the mean of its divisors is an integer number (122155072027).
Almost surely, 2244310144053 is an apocalyptic number.
It is an amenable number.
244310144053 is a deficient number, since it is larger than the sum of its proper divisors (1).
244310144053 is an equidigital number, since it uses as much as digits as its factorization.
244310144053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 244310144053 its reverse (350441013442), we get a palindrome (594751157495).
The spelling of 244310144053 in words is "two hundred forty-four billion, three hundred ten million, one hundred forty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •