Base | Representation |
---|---|
bin | 11000000110101… |
… | …01100000100101 |
3 | 112002110212210120 |
4 | 30003111200211 |
5 | 403230414000 |
6 | 32021512153 |
7 | 5003452440 |
oct | 1403254045 |
9 | 462425716 |
10 | 202201125 |
11 | a4156775 |
12 | 57872659 |
13 | 32b78149 |
14 | 1cbd6657 |
15 | 12b416a0 |
hex | c0d5825 |
202201125 has 32 divisors (see below), whose sum is σ = 384533760. Its totient is φ = 92433600.
The previous prime is 202201123. The next prime is 202201133. The reversal of 202201125 is 521102202.
It is not a de Polignac number, because 202201125 - 21 = 202201123 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202201123) 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 31 ways as a sum of consecutive naturals, for example, 35890 + ... + 41139.
It is an arithmetic number, because the mean of its divisors is an integer number (12016680).
Almost surely, 2202201125 is an apocalyptic number.
202201125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
202201125 is a deficient number, since it is larger than the sum of its proper divisors (182332635).
202201125 is an equidigital number, since it uses as much as digits as its factorization.
202201125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77054 (or 77044 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 15.
The square root of 202201125 is about 14219.7441960114. The cubic root of 202201125 is about 586.9411011933.
Adding to 202201125 its reverse (521102202), we get a palindrome (723303327).
The spelling of 202201125 in words is "two hundred two million, two hundred one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •