Base | Representation |
---|---|
bin | 11000000111101… |
… | …11101010110010 |
3 | 112002201222201200 |
4 | 30003313222302 |
5 | 403244403132 |
6 | 32024512030 |
7 | 5004604401 |
oct | 1403675262 |
9 | 462658650 |
10 | 202341042 |
11 | a4241902 |
12 | 5791b616 |
13 | 32bc6a37 |
14 | 1cc31638 |
15 | 12b6cd7c |
hex | c0f7ab2 |
202341042 has 12 divisors (see below), whose sum is σ = 438405630. Its totient is φ = 67447008.
The previous prime is 202341037. The next prime is 202341047. The reversal of 202341042 is 240143202.
It is an interprime number because it is at equal distance from previous prime (202341037) and next prime (202341047).
It can be written as a sum of positive squares in only one way, i.e., 188210961 + 14130081 = 13719^2 + 3759^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 11241169 = 202341042 / (2 + 0 + 2 + 3 + 4 + 1 + 0 + 4 + 2).
It is not an unprimeable number, because it can be changed into a prime (202341047) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5620567 + ... + 5620602.
Almost surely, 2202341042 is an apocalyptic number.
202341042 is an abundant number, since it is smaller than the sum of its proper divisors (236064588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202341042 is a wasteful number, since it uses less digits than its factorization.
202341042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11241177 (or 11241174 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 18.
The square root of 202341042 is about 14224.6631594565. The cubic root of 202341042 is about 587.0764517477.
Adding to 202341042 its reverse (240143202), we get a palindrome (442484244).
The spelling of 202341042 in words is "two hundred two million, three hundred forty-one thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •