Base | Representation |
---|---|
bin | 100010000111000… |
… | …1000100010001101 |
3 | 2221202200110012102 |
4 | 1010032020202031 |
5 | 4321001240121 |
6 | 305323444445 |
7 | 40235363654 |
oct | 10416104215 |
9 | 2852613172 |
10 | 1144555661 |
11 | 538087677 |
12 | 27b386725 |
13 | 153180c92 |
14 | ac01a19b |
15 | 6a73790b |
hex | 4438888d |
1144555661 has 2 divisors, whose sum is σ = 1144555662. Its totient is φ = 1144555660.
The previous prime is 1144555613. The next prime is 1144555663. The reversal of 1144555661 is 1665554411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1120240900 + 24314761 = 33470^2 + 4931^2 .
It is a cyclic number.
It is not a de Polignac number, because 1144555661 - 26 = 1144555597 is a prime.
It is a super-2 number, since 2×11445556612 = 2620015322254293842, which contains 22 as substring.
Together with 1144555663, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1144555663) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 572277830 + 572277831.
It is an arithmetic number, because the mean of its divisors is an integer number (572277831).
Almost surely, 21144555661 is an apocalyptic number.
It is an amenable number.
1144555661 is a deficient number, since it is larger than the sum of its proper divisors (1).
1144555661 is an equidigital number, since it uses as much as digits as its factorization.
1144555661 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 72000, while the sum is 38.
The square root of 1144555661 is about 33831.2822843001. The cubic root of 1144555661 is about 1046.0336105297.
The spelling of 1144555661 in words is "one billion, one hundred forty-four million, five hundred fifty-five thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •