Base | Representation |
---|---|
bin | 11101000110110… |
… | …00010100001101 |
3 | 122000102101121021 |
4 | 32203120110031 |
5 | 1000000440121 |
6 | 40121034141 |
7 | 6023201041 |
oct | 1643302415 |
9 | 560371537 |
10 | 244155661 |
11 | 115901842 |
12 | 69925951 |
13 | 3b777509 |
14 | 245d8021 |
15 | 1667c641 |
hex | e8d850d |
244155661 has 2 divisors, whose sum is σ = 244155662. Its totient is φ = 244155660.
The previous prime is 244155641. The next prime is 244155671. The reversal of 244155661 is 166551442.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 243953161 + 202500 = 15619^2 + 450^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-244155661 is a prime.
It is a super-2 number, since 2×2441556612 = 119223973596693842, which contains 22 as substring.
It is equal to p13376635 and since 244155661 and 13376635 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (244155641) 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, 122077830 + 122077831.
It is an arithmetic number, because the mean of its divisors is an integer number (122077831).
Almost surely, 2244155661 is an apocalyptic number.
It is an amenable number.
244155661 is a deficient number, since it is larger than the sum of its proper divisors (1).
244155661 is an equidigital number, since it uses as much as digits as its factorization.
244155661 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 28800, while the sum is 34.
The square root of 244155661 is about 15625.4811445920. The cubic root of 244155661 is about 625.0128304566.
The spelling of 244155661 in words is "two hundred forty-four million, one hundred fifty-five thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •