Base | Representation |
---|---|
bin | 11000000101111… |
… | …01100110101110 |
3 | 112002021220111020 |
4 | 30002331212232 |
5 | 403214300324 |
6 | 32015435010 |
7 | 5002564125 |
oct | 1402754656 |
9 | 462256436 |
10 | 202103214 |
11 | a409a155 |
12 | 57825a66 |
13 | 32b42701 |
14 | 1cbacabc |
15 | 12b22679 |
hex | c0bd9ae |
202103214 has 8 divisors (see below), whose sum is σ = 404206440. Its totient is φ = 67367736.
The previous prime is 202103189. The next prime is 202103219. The reversal of 202103214 is 412301202.
202103214 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
202103214 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 202103193 and 202103202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202103219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16841929 + ... + 16841940.
It is an arithmetic number, because the mean of its divisors is an integer number (50525805).
Almost surely, 2202103214 is an apocalyptic number.
202103214 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202103214 is a wasteful number, since it uses less digits than its factorization.
202103214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33683874.
The product of its (nonzero) digits is 96, while the sum is 15.
The square root of 202103214 is about 14216.3009956880. The cubic root of 202103214 is about 586.8463485578.
Adding to 202103214 its reverse (412301202), we get a palindrome (614404416).
The spelling of 202103214 in words is "two hundred two million, one hundred three thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •