Base | Representation |
---|---|
bin | 11000000110111… |
… | …00111011000101 |
3 | 112002112102110022 |
4 | 30003130323011 |
5 | 403232401433 |
6 | 32022304525 |
7 | 5003640122 |
oct | 1403347305 |
9 | 462472408 |
10 | 202231493 |
11 | a4177572 |
12 | 57888145 |
13 | 32b88c09 |
14 | 1cc03749 |
15 | 12b4a698 |
hex | c0dcec5 |
202231493 has 2 divisors, whose sum is σ = 202231494. Its totient is φ = 202231492.
The previous prime is 202231441. The next prime is 202231499. The reversal of 202231493 is 394132202.
202231493 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 119093569 + 83137924 = 10913^2 + 9118^2 .
It is a cyclic number.
It is not a de Polignac number, because 202231493 - 26 = 202231429 is a prime.
It is a super-2 number, since 2×2022314932 = 81795153522018098, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202231499) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101115746 + 101115747.
It is an arithmetic number, because the mean of its divisors is an integer number (101115747).
Almost surely, 2202231493 is an apocalyptic number.
It is an amenable number.
202231493 is a deficient number, since it is larger than the sum of its proper divisors (1).
202231493 is an equidigital number, since it uses as much as digits as its factorization.
202231493 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 26.
The square root of 202231493 is about 14220.8119669729. The cubic root of 202231493 is about 586.9704833824.
Adding to 202231493 its reverse (394132202), we get a palindrome (596363695).
The spelling of 202231493 in words is "two hundred two million, two hundred thirty-one thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •