Base | Representation |
---|---|
bin | 1110110001111000000000… |
… | …01001100000111110101101 |
3 | 11021001222020021102121101012 |
4 | 13120330000021200332231 |
5 | 13224440020111220323 |
6 | 153042145244355005 |
7 | 6563022536100431 |
oct | 730740011407655 |
9 | 137058207377335 |
10 | 32500020023213 |
11 | a3a01aa036046 |
12 | 378a87ab45a65 |
13 | 151997b012232 |
14 | 80501b9929c1 |
15 | 3b5600542678 |
hex | 1d8f00260fad |
32500020023213 has 2 divisors, whose sum is σ = 32500020023214. Its totient is φ = 32500020023212.
The previous prime is 32500020023209. The next prime is 32500020023221. The reversal of 32500020023213 is 31232002000523.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27968835142249 + 4531184880964 = 5288557^2 + 2128658^2 .
It is a cyclic number.
It is not a de Polignac number, because 32500020023213 - 22 = 32500020023209 is a prime.
It is a super-3 number, since 3×325000200232133 (a number of 42 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32500020023203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16250010011606 + 16250010011607.
It is an arithmetic number, because the mean of its divisors is an integer number (16250010011607).
Almost surely, 232500020023213 is an apocalyptic number.
It is an amenable number.
32500020023213 is a deficient number, since it is larger than the sum of its proper divisors (1).
32500020023213 is an equidigital number, since it uses as much as digits as its factorization.
32500020023213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 23.
Adding to 32500020023213 its reverse (31232002000523), we get a palindrome (63732022023736).
The spelling of 32500020023213 in words is "thirty-two trillion, five hundred billion, twenty million, twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •