Base | Representation |
---|---|
bin | 11100010010101001100… |
… | …001001000011100110101 |
3 | 20212212020111110000200002 |
4 | 130102221201020130311 |
5 | 223323124312041121 |
6 | 4045050010201045 |
7 | 260314216660646 |
oct | 34225141103465 |
9 | 6785214400602 |
10 | 1944169252661 |
11 | 68a576949a89 |
12 | 274962423185 |
13 | 1114468089bc |
14 | 6a153a0b6cd |
15 | 3588b7d3e0b |
hex | 1c4a9848735 |
1944169252661 has 2 divisors, whose sum is σ = 1944169252662. Its totient is φ = 1944169252660.
The previous prime is 1944169252631. The next prime is 1944169252721. The reversal of 1944169252661 is 1662529614491.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1874966058436 + 69203194225 = 1369294^2 + 263065^2 .
It is an emirp because it is prime and its reverse (1662529614491) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1944169252661 - 214 = 1944169236277 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1944169252597 and 1944169252606.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1944169252631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 972084626330 + 972084626331.
It is an arithmetic number, because the mean of its divisors is an integer number (972084626331).
Almost surely, 21944169252661 is an apocalyptic number.
It is an amenable number.
1944169252661 is a deficient number, since it is larger than the sum of its proper divisors (1).
1944169252661 is an equidigital number, since it uses as much as digits as its factorization.
1944169252661 is an evil number, because the sum of its binary digits is even.
The product of its digits is 5598720, while the sum is 56.
The spelling of 1944169252661 in words is "one trillion, nine hundred forty-four billion, one hundred sixty-nine million, two hundred fifty-two thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •