Base | Representation |
---|---|
bin | 111011101011000… |
… | …1110010001101111 |
3 | 12011112201002220210 |
4 | 1313112032101233 |
5 | 13100043024401 |
6 | 530404313503 |
7 | 100422251112 |
oct | 16726162157 |
9 | 5145632823 |
10 | 2002314351 |
11 | 938288454 |
12 | 47a6a2893 |
13 | 25baa78bb |
14 | 14dcdc579 |
15 | babbd4d6 |
hex | 7758e46f |
2002314351 has 8 divisors (see below), whose sum is σ = 2726555904. Its totient is φ = 1306474520.
The previous prime is 2002314343. The next prime is 2002314359. The reversal of 2002314351 is 1534132002.
It is an interprime number because it is at equal distance from previous prime (2002314343) and next prime (2002314359).
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 2002314351 - 23 = 2002314343 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002314359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7100265 + ... + 7100546.
It is an arithmetic number, because the mean of its divisors is an integer number (340819488).
Almost surely, 22002314351 is an apocalyptic number.
2002314351 is a deficient number, since it is larger than the sum of its proper divisors (724241553).
2002314351 is a wasteful number, since it uses less digits than its factorization.
2002314351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14200861.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 2002314351 is about 44747.2272995769. The cubic root of 2002314351 is about 1260.4068458163.
Adding to 2002314351 its reverse (1534132002), we get a palindrome (3536446353).
The spelling of 2002314351 in words is "two billion, two million, three hundred fourteen thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •