Base | Representation |
---|---|
bin | 1001001110111001111000… |
… | …01111100110110010000001 |
3 | 2122212222102100200112020201 |
4 | 10213130330033212302001 |
5 | 10130122200202212121 |
6 | 111103114510405201 |
7 | 4163603140062304 |
oct | 447347417466201 |
9 | 78788370615221 |
10 | 20303321132161 |
11 | 6518654522061 |
12 | 233ab05200801 |
13 | b437971b34b2 |
14 | 5029864bab3b |
15 | 253208dbde91 |
hex | 12773c3e6c81 |
20303321132161 has 2 divisors, whose sum is σ = 20303321132162. Its totient is φ = 20303321132160.
The previous prime is 20303321132089. The next prime is 20303321132173. The reversal of 20303321132161 is 16123112330302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16605176753025 + 3698144379136 = 4074945^2 + 1923056^2 .
It is a cyclic number.
It is not a de Polignac number, because 20303321132161 - 215 = 20303321099393 is a prime.
It is not a weakly prime, because it can be changed into another prime (20303321142161) 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, 10151660566080 + 10151660566081.
It is an arithmetic number, because the mean of its divisors is an integer number (10151660566081).
Almost surely, 220303321132161 is an apocalyptic number.
It is an amenable number.
20303321132161 is a deficient number, since it is larger than the sum of its proper divisors (1).
20303321132161 is an equidigital number, since it uses as much as digits as its factorization.
20303321132161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 20303321132161 its reverse (16123112330302), we get a palindrome (36426433462463).
The spelling of 20303321132161 in words is "twenty trillion, three hundred three billion, three hundred twenty-one million, one hundred thirty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.309 sec. • engine limits •