Base | Representation |
---|---|
bin | 10010111110100011… |
… | …000100000111100101 |
3 | 1221121002102020120201 |
4 | 102332203010013211 |
5 | 313212420412013 |
6 | 13205544030501 |
7 | 1320645236212 |
oct | 227643040745 |
9 | 57532366521 |
10 | 20376732133 |
11 | 870715249a |
12 | 3b48162431 |
13 | 1bc9760564 |
14 | db4350b09 |
15 | 7e3d853dd |
hex | 4be8c41e5 |
20376732133 has 2 divisors, whose sum is σ = 20376732134. Its totient is φ = 20376732132.
The previous prime is 20376732097. The next prime is 20376732157. The reversal of 20376732133 is 33123767302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17285149729 + 3091582404 = 131473^2 + 55602^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20376732133 is a prime.
It is a super-2 number, since 2×203767321332 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20376732092 and 20376732101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20376732163) 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, 10188366066 + 10188366067.
It is an arithmetic number, because the mean of its divisors is an integer number (10188366067).
Almost surely, 220376732133 is an apocalyptic number.
It is an amenable number.
20376732133 is a deficient number, since it is larger than the sum of its proper divisors (1).
20376732133 is an equidigital number, since it uses as much as digits as its factorization.
20376732133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 95256, while the sum is 37.
The spelling of 20376732133 in words is "twenty billion, three hundred seventy-six million, seven hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •