Base | Representation |
---|---|
bin | 110101010101001000011… |
… | …100111110111000110101 |
3 | 110222100112210101200102002 |
4 | 311111020130332320311 |
5 | 440021024100120121 |
6 | 11443332444225045 |
7 | 525526502430011 |
oct | 65251034767065 |
9 | 13870483350362 |
10 | 3664822660661 |
11 | 11932739396a8 |
12 | 4b232583b185 |
13 | 20778c0c4346 |
14 | c954232b541 |
15 | 654e53dae0b |
hex | 3554873ee35 |
3664822660661 has 2 divisors, whose sum is σ = 3664822660662. Its totient is φ = 3664822660660.
The previous prime is 3664822660613. The next prime is 3664822660687. The reversal of 3664822660661 is 1660662284663.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3658444242436 + 6378418225 = 1912706^2 + 79865^2 .
It is a cyclic number.
It is not a de Polignac number, because 3664822660661 - 238 = 3389944753717 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3664822660597 and 3664822660606.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3664822660601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1832411330330 + 1832411330331.
It is an arithmetic number, because the mean of its divisors is an integer number (1832411330331).
Almost surely, 23664822660661 is an apocalyptic number.
It is an amenable number.
3664822660661 is a deficient number, since it is larger than the sum of its proper divisors (1).
3664822660661 is an equidigital number, since it uses as much as digits as its factorization.
3664822660661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17915904, while the sum is 56.
The spelling of 3664822660661 in words is "three trillion, six hundred sixty-four billion, eight hundred twenty-two million, six hundred sixty thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •