Base | Representation |
---|---|
bin | 101110000001101011010001… |
… | …100111110011001111010001 |
3 | 222112201200010222111121110011 |
4 | 232001223101213303033101 |
5 | 203013014031314011423 |
6 | 1554304524420434521 |
7 | 60431514162224305 |
oct | 5601532147631721 |
9 | 875650128447404 |
10 | 202425325532113 |
11 | 5955410a055662 |
12 | 1a853473b48a41 |
13 | 88c481ac65038 |
14 | 37db61bd5bd05 |
15 | 1860831edbb0d |
hex | b81ad19f33d1 |
202425325532113 has 8 divisors (see below), whose sum is σ = 202462810425288. Its totient is φ = 202387844127744.
The previous prime is 202425325532083. The next prime is 202425325532147. The reversal of 202425325532113 is 311235523524202.
It can be written as a sum of positive squares in 4 ways, for example, as 61426610025169 + 140998715506944 = 7837513^2 + 11874288^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 202425325532113 - 29 = 202425325531601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202425325532713) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 116642445 + ... + 118365157.
It is an arithmetic number, because the mean of its divisors is an integer number (25307851303161).
Almost surely, 2202425325532113 is an apocalyptic number.
It is an amenable number.
202425325532113 is a deficient number, since it is larger than the sum of its proper divisors (37484893175).
202425325532113 is a wasteful number, since it uses less digits than its factorization.
202425325532113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1744403.
The product of its (nonzero) digits is 432000, while the sum is 40.
The spelling of 202425325532113 in words is "two hundred two trillion, four hundred twenty-five billion, three hundred twenty-five million, five hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •