Base | Representation |
---|---|
bin | 11000001010010… |
… | …00000000101000 |
3 | 112010100201010202 |
4 | 30011020000220 |
5 | 403340420440 |
6 | 32035531332 |
7 | 5010444662 |
oct | 1405100050 |
9 | 463321122 |
10 | 202670120 |
11 | a4447074 |
12 | 57a59b48 |
13 | 32cb0763 |
14 | 1ccb9532 |
15 | 12bd5615 |
hex | c148028 |
202670120 has 16 divisors (see below), whose sum is σ = 456007860. Its totient is φ = 81068032.
The previous prime is 202670101. The next prime is 202670129. The reversal of 202670120 is 21076202.
It can be written as a sum of positive squares in 2 ways, for example, as 178008964 + 24661156 = 13342^2 + 4966^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 202670092 and 202670101.
It is not an unprimeable number, because it can be changed into a prime (202670129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2533337 + ... + 2533416.
Almost surely, 2202670120 is an apocalyptic number.
202670120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
202670120 is an abundant number, since it is smaller than the sum of its proper divisors (253337740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202670120 is a wasteful number, since it uses less digits than its factorization.
202670120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5066764 (or 5066760 counting only the distinct ones).
The product of its (nonzero) digits is 336, while the sum is 20.
The square root of 202670120 is about 14236.2256233877. The cubic root of 202670120 is about 587.3945439207.
The spelling of 202670120 in words is "two hundred two million, six hundred seventy thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •