Base | Representation |
---|---|
bin | 1110100011111010010101… |
… | …00111010010000001111101 |
3 | 11012101002211002111122220121 |
4 | 13101331022213102001331 |
5 | 13144104414122100013 |
6 | 152033520355414541 |
7 | 6513246136522504 |
oct | 721751247220175 |
9 | 135332732448817 |
10 | 32020233003133 |
11 | a225782845631 |
12 | 371189b2b4451 |
13 | 14b365871c40b |
14 | 7c9b0505583b |
15 | 3a7dbe1ea58d |
hex | 1d1f4a9d207d |
32020233003133 has 2 divisors, whose sum is σ = 32020233003134. Its totient is φ = 32020233003132.
The previous prime is 32020233003103. The next prime is 32020233003181. The reversal of 32020233003133 is 33130033202023.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27046427581924 + 4973805421209 = 5200618^2 + 2230203^2 .
It is a cyclic number.
It is not a de Polignac number, because 32020233003133 - 213 = 32020232994941 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32020233003098 and 32020233003107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32020233003103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16010116501566 + 16010116501567.
It is an arithmetic number, because the mean of its divisors is an integer number (16010116501567).
Almost surely, 232020233003133 is an apocalyptic number.
It is an amenable number.
32020233003133 is a deficient number, since it is larger than the sum of its proper divisors (1).
32020233003133 is an equidigital number, since it uses as much as digits as its factorization.
32020233003133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832, while the sum is 25.
Adding to 32020233003133 its reverse (33130033202023), we get a palindrome (65150266205156).
The spelling of 32020233003133 in words is "thirty-two trillion, twenty billion, two hundred thirty-three million, three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •