Base | Representation |
---|---|
bin | 11101001000101001000… |
… | …001011101111000100111 |
3 | 21002101212210022001111112 |
4 | 131020221001131320213 |
5 | 230300342102312333 |
6 | 4131434413055235 |
7 | 264435653535440 |
oct | 35105101357047 |
9 | 7071783261445 |
10 | 2002143010343 |
11 | 702116596213 |
12 | 28404178751b |
13 | 116a55531028 |
14 | 6cc933342c7 |
15 | 371311dd948 |
hex | 1d22905de27 |
2002143010343 has 8 divisors (see below), whose sum is σ = 2325674316960. Its totient is φ = 1687989422880.
The previous prime is 2002143010337. The next prime is 2002143010349. The reversal of 2002143010343 is 3430103412002.
It is an interprime number because it is at equal distance from previous prime (2002143010337) and next prime (2002143010349).
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 2002143010343 - 26 = 2002143010279 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002143010349) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2344429328 + ... + 2344430181.
It is an arithmetic number, because the mean of its divisors is an integer number (290709289620).
Almost surely, 22002143010343 is an apocalyptic number.
2002143010343 is a deficient number, since it is larger than the sum of its proper divisors (323531306617).
2002143010343 is an equidigital number, since it uses as much as digits as its factorization.
2002143010343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4688859577.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 2002143010343 its reverse (3430103412002), we get a palindrome (5432246422345).
The spelling of 2002143010343 in words is "two trillion, two billion, one hundred forty-three million, ten thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •