Base | Representation |
---|---|
bin | 11101111001010011… |
… | …110100110111111001 |
3 | 10001212002211112121022 |
4 | 131321103310313321 |
5 | 1011220100332023 |
6 | 22425130352225 |
7 | 2214316411253 |
oct | 357123646771 |
9 | 101762745538 |
10 | 32100011513 |
11 | 1268268a839 |
12 | 627a28b675 |
13 | 304748826b |
14 | 17a72d8cd3 |
15 | c7d1947c8 |
hex | 7794f4df9 |
32100011513 has 2 divisors, whose sum is σ = 32100011514. Its totient is φ = 32100011512.
The previous prime is 32100011501. The next prime is 32100011519. The reversal of 32100011513 is 31511000123.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27182776384 + 4917235129 = 164872^2 + 70123^2 .
It is a cyclic number.
It is not a de Polignac number, because 32100011513 - 28 = 32100011257 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32100011491 and 32100011500.
It is not a weakly prime, because it can be changed into another prime (32100011519) 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, 16050005756 + 16050005757.
It is an arithmetic number, because the mean of its divisors is an integer number (16050005757).
Almost surely, 232100011513 is an apocalyptic number.
It is an amenable number.
32100011513 is a deficient number, since it is larger than the sum of its proper divisors (1).
32100011513 is an equidigital number, since it uses as much as digits as its factorization.
32100011513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 17.
Adding to 32100011513 its reverse (31511000123), we get a palindrome (63611011636).
The spelling of 32100011513 in words is "thirty-two billion, one hundred million, eleven thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •