Base | Representation |
---|---|
bin | 11101001001101000000… |
… | …010010101111000110110 |
3 | 21002111121110121002000211 |
4 | 131021220002111320312 |
5 | 230310023223014332 |
6 | 4132131340300034 |
7 | 264504111535621 |
oct | 35115002257066 |
9 | 7074543532024 |
10 | 2003200204342 |
11 | 702609323767 |
12 | 28429784161a |
13 | 116b93574bcc |
14 | 6cd538ccdb8 |
15 | 37193e1b447 |
hex | 1d268095e36 |
2003200204342 has 4 divisors (see below), whose sum is σ = 3004800306516. Its totient is φ = 1001600102170.
The previous prime is 2003200204339. The next prime is 2003200204367. The reversal of 2003200204342 is 2434020023002.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×20032002043422 (a number of 25 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (22) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 500800051084 + ... + 500800051087.
It is an arithmetic number, because the mean of its divisors is an integer number (751200076629).
Almost surely, 22003200204342 is an apocalyptic number.
2003200204342 is a deficient number, since it is larger than the sum of its proper divisors (1001600102174).
2003200204342 is a wasteful number, since it uses less digits than its factorization.
2003200204342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1001600102173.
The product of its (nonzero) digits is 2304, while the sum is 22.
Adding to 2003200204342 its reverse (2434020023002), we get a palindrome (4437220227344).
The spelling of 2003200204342 in words is "two trillion, three billion, two hundred million, two hundred four thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •