Base | Representation |
---|---|
bin | 11000000101010… |
… | …10100100011001 |
3 | 112002010221112100 |
4 | 30002222210121 |
5 | 403204301431 |
6 | 32014034013 |
7 | 5002120605 |
oct | 1402524431 |
9 | 462127470 |
10 | 202025241 |
11 | a4046610 |
12 | 577a8909 |
13 | 32b16082 |
14 | 1cb8c505 |
15 | 12b094e6 |
hex | c0aa919 |
202025241 has 48 divisors (see below), whose sum is σ = 327862080. Its totient is φ = 118834560.
The previous prime is 202025221. The next prime is 202025249. The reversal of 202025241 is 142520202.
It is not a de Polignac number, because 202025241 - 27 = 202025113 is a prime.
It is a super-2 number, since 2×2020252412 = 81628396002216162, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (202025249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 729195 + ... + 729471.
It is an arithmetic number, because the mean of its divisors is an integer number (6830460).
Almost surely, 2202025241 is an apocalyptic number.
It is an amenable number.
202025241 is a deficient number, since it is larger than the sum of its proper divisors (125836839).
202025241 is a wasteful number, since it uses less digits than its factorization.
202025241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 486 (or 483 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 18.
The square root of 202025241 is about 14213.5583510956. The cubic root of 202025241 is about 586.7708688803.
Adding to 202025241 its reverse (142520202), we get a palindrome (344545443).
It can be divided in two parts, 2020 and 25241, that added together give a triangular number (27261 = T233).
The spelling of 202025241 in words is "two hundred two million, twenty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •