Base | Representation |
---|---|
bin | 11000001000001… |
… | …10100011101111 |
3 | 112002212002101112 |
4 | 30010012203233 |
5 | 403303331111 |
6 | 32030102235 |
7 | 5005250246 |
oct | 1404064357 |
9 | 462762345 |
10 | 202402031 |
11 | a4283707 |
12 | 5794a97b |
13 | 32c18720 |
14 | 1cc4995d |
15 | 12b80e8b |
hex | c1068ef |
202402031 has 8 divisors (see below), whose sum is σ = 218107344. Its totient is φ = 186716160.
The previous prime is 202402027. The next prime is 202402073. The reversal of 202402031 is 130204202.
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 202402031 - 22 = 202402027 is a prime.
It is a super-2 number, since 2×2024020312 = 81933164305849922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 202401997 and 202402015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202402021) 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, 22511 + ... + 30191.
It is an arithmetic number, because the mean of its divisors is an integer number (27263418).
Almost surely, 2202402031 is an apocalyptic number.
202402031 is a deficient number, since it is larger than the sum of its proper divisors (15705313).
202402031 is a wasteful number, since it uses less digits than its factorization.
202402031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9721.
The product of its (nonzero) digits is 96, while the sum is 14.
The square root of 202402031 is about 14226.8067745366. The cubic root of 202402031 is about 587.1354307344.
Adding to 202402031 its reverse (130204202), we get a palindrome (332606233).
The spelling of 202402031 in words is "two hundred two million, four hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •