Base | Representation |
---|---|
bin | 101000000101111001011011… |
… | …0110110011000001010111101 |
3 | 1201020122102020111112121202002 |
4 | 1100023302312312120022331 |
5 | 332210341342031314221 |
6 | 3250011042240512045 |
7 | 134165266610603261 |
oct | 12013626666301275 |
9 | 1636572214477662 |
10 | 352654242448061 |
11 | a2403908203a64 |
12 | 3367690831b625 |
13 | 121a11c99a7c68 |
14 | 63127b0aca0a1 |
15 | 2ab852d37580b |
hex | 140bcb6d982bd |
352654242448061 has 2 divisors, whose sum is σ = 352654242448062. Its totient is φ = 352654242448060.
The previous prime is 352654242448021. The next prime is 352654242448069. The reversal of 352654242448061 is 160844242456253.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 294391645044025 + 58262597404036 = 17157845^2 + 7632994^2 .
It is a cyclic number.
It is not a de Polignac number, because 352654242448061 - 214 = 352654242431677 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 352654242447988 and 352654242448006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (352654242448069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 176327121224030 + 176327121224031.
It is an arithmetic number, because the mean of its divisors is an integer number (176327121224031).
Almost surely, 2352654242448061 is an apocalyptic number.
It is an amenable number.
352654242448061 is a deficient number, since it is larger than the sum of its proper divisors (1).
352654242448061 is an equidigital number, since it uses as much as digits as its factorization.
352654242448061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 44236800, while the sum is 56.
The spelling of 352654242448061 in words is "three hundred fifty-two trillion, six hundred fifty-four billion, two hundred forty-two million, four hundred forty-eight thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •