Base | Representation |
---|---|
bin | 1110100110100001100011… |
… | …11010110111011111100101 |
3 | 11012200200120000110002002102 |
4 | 13103100301322313133211 |
5 | 13202042301313121013 |
6 | 152143045241021445 |
7 | 6522605025213266 |
oct | 723206172673745 |
9 | 135620500402072 |
10 | 32110013020133 |
11 | a25a864275194 |
12 | 3727176484885 |
13 | 14bbc65aab929 |
14 | 7d01c0a4c96d |
15 | 3aa3c60c1d58 |
hex | 1d3431eb77e5 |
32110013020133 has 2 divisors, whose sum is σ = 32110013020134. Its totient is φ = 32110013020132.
The previous prime is 32110013020103. The next prime is 32110013020147. The reversal of 32110013020133 is 33102031001123.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17076580993924 + 15033432026209 = 4132382^2 + 3877297^2 .
It is a cyclic number.
It is not a de Polignac number, because 32110013020133 - 230 = 32108939278309 is a prime.
It is a super-2 number, since 2×321100130201332 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32110013020103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16055006510066 + 16055006510067.
It is an arithmetic number, because the mean of its divisors is an integer number (16055006510067).
Almost surely, 232110013020133 is an apocalyptic number.
It is an amenable number.
32110013020133 is a deficient number, since it is larger than the sum of its proper divisors (1).
32110013020133 is an equidigital number, since it uses as much as digits as its factorization.
32110013020133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 32110013020133 its reverse (33102031001123), we get a palindrome (65212044021256).
The spelling of 32110013020133 in words is "thirty-two trillion, one hundred ten billion, thirteen million, twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •