Base | Representation |
---|---|
bin | 11000000111101… |
… | …01010001001101 |
3 | 112002201111020122 |
4 | 30003311101031 |
5 | 403244044323 |
6 | 32024354325 |
7 | 5004533630 |
oct | 1403652115 |
9 | 462644218 |
10 | 202331213 |
11 | a4235487 |
12 | 579159a5 |
13 | 32bc2416 |
14 | 1cc2bc17 |
15 | 12b69ec8 |
hex | c0f544d |
202331213 has 8 divisors (see below), whose sum is σ = 231510528. Its totient is φ = 173220624.
The previous prime is 202331197. The next prime is 202331251. The reversal of 202331213 is 312133202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 202331213 - 24 = 202331197 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202331191 and 202331200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202331293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10706 + ... + 22787.
It is an arithmetic number, because the mean of its divisors is an integer number (28938816).
Almost surely, 2202331213 is an apocalyptic number.
It is an amenable number.
202331213 is a deficient number, since it is larger than the sum of its proper divisors (29179315).
202331213 is an equidigital number, since it uses as much as digits as its factorization.
202331213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34363.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 202331213 is about 14224.3176637757. The cubic root of 202331213 is about 587.0669455730.
Adding to 202331213 its reverse (312133202), we get a palindrome (514464415).
The spelling of 202331213 in words is "two hundred two million, three hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •