Base | Representation |
---|---|
bin | 11000000101001… |
… | …11010101100000 |
3 | 112002010021100221 |
4 | 30002213111200 |
5 | 403203341000 |
6 | 32013452424 |
7 | 5002034161 |
oct | 1402472540 |
9 | 462107327 |
10 | 202012000 |
11 | a4037673 |
12 | 577a1114 |
13 | 32b10038 |
14 | 1cb87768 |
15 | 12b0561a |
hex | c0a7560 |
202012000 has 48 divisors (see below), whose sum is σ = 496353312. Its totient is φ = 80803200.
The previous prime is 202011977. The next prime is 202012001. The reversal of 202012000 is 210202.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202012001) 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 7 ways as a sum of consecutive naturals, for example, 21252 + ... + 29251.
It is an arithmetic number, because the mean of its divisors is an integer number (10340694).
Almost surely, 2202012000 is an apocalyptic number.
202012000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
202012000 is an abundant number, since it is smaller than the sum of its proper divisors (294341312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202012000 is an equidigital number, since it uses as much as digits as its factorization.
202012000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50528 (or 50510 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 7.
The square root of 202012000 is about 14213.0925558092. The cubic root of 202012000 is about 586.7580493554.
Adding to 202012000 its reverse (210202), we get a palindrome (202222202).
It can be divided in two parts, 20201 and 2000, that added together give a square (22201 = 1492).
The spelling of 202012000 in words is "two hundred two million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •