Base | Representation |
---|---|
bin | 11000001100100… |
… | …10111101110010 |
3 | 112010221022021210 |
4 | 30012102331302 |
5 | 403430232023 |
6 | 32050300550 |
7 | 5013164040 |
oct | 1406227562 |
9 | 463838253 |
10 | 202977138 |
11 | a4636801 |
12 | 57b87756 |
13 | 3308a420 |
14 | 1cd59390 |
15 | 12c46593 |
hex | c192f72 |
202977138 has 64 divisors (see below), whose sum is σ = 505370880. Its totient is φ = 52918272.
The previous prime is 202977109. The next prime is 202977179. The reversal of 202977138 is 831779202.
202977138 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 202977096 and 202977105.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 46506 + ... + 50682.
It is an arithmetic number, because the mean of its divisors is an integer number (7896420).
Almost surely, 2202977138 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 202977138, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (252685440).
202977138 is an abundant number, since it is smaller than the sum of its proper divisors (302393742).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202977138 is a wasteful number, since it uses less digits than its factorization.
202977138 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4291.
The product of its (nonzero) digits is 42336, while the sum is 39.
The square root of 202977138 is about 14247.0045272682. The cubic root of 202977138 is about 587.6910022092.
The spelling of 202977138 in words is "two hundred two million, nine hundred seventy-seven thousand, one hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •