Base | Representation |
---|---|
bin | 11000001000001… |
… | …10010110101001 |
3 | 112002212001020111 |
4 | 30010012112221 |
5 | 403303314233 |
6 | 32030054321 |
7 | 5005244641 |
oct | 1404062651 |
9 | 462761214 |
10 | 202401193 |
11 | a4283015 |
12 | 5794a3a1 |
13 | 32c18227 |
14 | 1cc49521 |
15 | 12b80acd |
hex | c1065a9 |
202401193 has 4 divisors (see below), whose sum is σ = 204192468. Its totient is φ = 200609920.
The previous prime is 202401181. The next prime is 202401203. The reversal of 202401193 is 391104202.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 93470224 + 108930969 = 9668^2 + 10437^2 .
It is a cyclic number.
It is not a de Polignac number, because 202401193 - 217 = 202270121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202401113) 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 3 ways as a sum of consecutive naturals, for example, 895468 + ... + 895693.
It is an arithmetic number, because the mean of its divisors is an integer number (51048117).
Almost surely, 2202401193 is an apocalyptic number.
It is an amenable number.
202401193 is a deficient number, since it is larger than the sum of its proper divisors (1791275).
202401193 is a wasteful number, since it uses less digits than its factorization.
202401193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1791274.
The product of its (nonzero) digits is 432, while the sum is 22.
The square root of 202401193 is about 14226.7773230623. Note that the first 3 decimals coincide. The cubic root of 202401193 is about 587.1346204326.
Adding to 202401193 its reverse (391104202), we get a palindrome (593505395).
The spelling of 202401193 in words is "two hundred two million, four hundred one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •