Base | Representation |
---|---|
bin | 1011110000101001000… |
… | …0000011000111001101 |
3 | 201022111012022212011210 |
4 | 2330022100003013031 |
5 | 11302232033122000 |
6 | 232451440405033 |
7 | 20411424631416 |
oct | 2741220030715 |
9 | 638435285153 |
10 | 202035442125 |
11 | 78756815a80 |
12 | 331a5316779 |
13 | 16089c255ba |
14 | 9ac856480d |
15 | 53c6ed8350 |
hex | 2f0a4031cd |
202035442125 has 64 divisors (see below), whose sum is σ = 368178400512. Its totient is φ = 97574912000.
The previous prime is 202035442067. The next prime is 202035442127. The reversal of 202035442125 is 521244530202.
It is not a de Polignac number, because 202035442125 - 27 = 202035441997 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 202035442092 and 202035442101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202035442127) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 964837 + ... + 1155413.
It is an arithmetic number, because the mean of its divisors is an integer number (5752787508).
Almost surely, 2202035442125 is an apocalyptic number.
202035442125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
202035442125 is a deficient number, since it is larger than the sum of its proper divisors (166142958387).
202035442125 is a wasteful number, since it uses less digits than its factorization.
202035442125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 190863 (or 190853 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 30.
Adding to 202035442125 its reverse (521244530202), we get a palindrome (723279972327).
The spelling of 202035442125 in words is "two hundred two billion, thirty-five million, four hundred forty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •