Base | Representation |
---|---|
bin | 11101111001011111… |
… | …111111110011011101 |
3 | 10001212022211122010222 |
4 | 131321133333303131 |
5 | 1011221404431023 |
6 | 22425323011125 |
7 | 2214355500101 |
oct | 357137776335 |
9 | 101768748128 |
10 | 32103202013 |
11 | 12684469913 |
12 | 627b369aa5 |
13 | 304803452c |
14 | 17a78c9901 |
15 | c7d5c4cc8 |
hex | 7797ffcdd |
32103202013 has 2 divisors, whose sum is σ = 32103202014. Its totient is φ = 32103202012.
The previous prime is 32103201989. The next prime is 32103202121. The reversal of 32103202013 is 31020230123.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29908935364 + 2194266649 = 172942^2 + 46843^2 .
It is a cyclic number.
It is not a de Polignac number, because 32103202013 - 216 = 32103136477 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32103201982 and 32103202000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32103202213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16051601006 + 16051601007.
It is an arithmetic number, because the mean of its divisors is an integer number (16051601007).
Almost surely, 232103202013 is an apocalyptic number.
It is an amenable number.
32103202013 is a deficient number, since it is larger than the sum of its proper divisors (1).
32103202013 is an equidigital number, since it uses as much as digits as its factorization.
32103202013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 32103202013 its reverse (31020230123), we get a palindrome (63123432136).
The spelling of 32103202013 in words is "thirty-two billion, one hundred three million, two hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •