Base | Representation |
---|---|
bin | 1001010000011001100001… |
… | …00001001110100110010001 |
3 | 2200001212221112102010000222 |
4 | 10220030300201032212101 |
5 | 10131442322443021112 |
6 | 111142445323122425 |
7 | 4200401356403663 |
oct | 450146041164621 |
9 | 80055845363028 |
10 | 20354664032657 |
11 | 6538401224129 |
12 | 2348a53973415 |
13 | b4858a22bca6 |
14 | 5052572d8533 |
15 | 2547115ca372 |
hex | 12833084e991 |
20354664032657 has 2 divisors, whose sum is σ = 20354664032658. Its totient is φ = 20354664032656.
The previous prime is 20354664032641. The next prime is 20354664032693. The reversal of 20354664032657 is 75623046645302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19445312979856 + 909351052801 = 4409684^2 + 953599^2 .
It is a cyclic number.
It is not a de Polignac number, because 20354664032657 - 24 = 20354664032641 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20354664032599 and 20354664032608.
It is not a weakly prime, because it can be changed into another prime (20354664032957) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10177332016328 + 10177332016329.
It is an arithmetic number, because the mean of its divisors is an integer number (10177332016329).
Almost surely, 220354664032657 is an apocalyptic number.
It is an amenable number.
20354664032657 is a deficient number, since it is larger than the sum of its proper divisors (1).
20354664032657 is an equidigital number, since it uses as much as digits as its factorization.
20354664032657 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21772800, while the sum is 53.
The spelling of 20354664032657 in words is "twenty trillion, three hundred fifty-four billion, six hundred sixty-four million, thirty-two thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •