Base | Representation |
---|---|
bin | 11101001000101000110… |
… | …111001110000011101001 |
3 | 21002101212121020120122001 |
4 | 131020220313032003221 |
5 | 230300340410332243 |
6 | 4131434235331001 |
7 | 264435621646651 |
oct | 35105067160351 |
9 | 7071777216561 |
10 | 2002140324073 |
11 | 702115020a5a |
12 | 2840408b0a61 |
13 | 116a54b00416 |
14 | 6cc92c35361 |
15 | 37130d5ca4d |
hex | 1d228dce0e9 |
2002140324073 has 4 divisors (see below), whose sum is σ = 2002160409088. Its totient is φ = 2002120239060.
The previous prime is 2002140324059. The next prime is 2002140324103. The reversal of 2002140324073 is 3704230412002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2002140324073 is a prime.
It is a super-3 number, since 3×20021403240733 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2002140324043) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9892233 + ... + 10092598.
It is an arithmetic number, because the mean of its divisors is an integer number (500540102272).
Almost surely, 22002140324073 is an apocalyptic number.
It is an amenable number.
2002140324073 is a deficient number, since it is larger than the sum of its proper divisors (20085015).
2002140324073 is a wasteful number, since it uses less digits than its factorization.
2002140324073 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20085014.
The product of its (nonzero) digits is 8064, while the sum is 28.
Adding to 2002140324073 its reverse (3704230412002), we get a palindrome (5706370736075).
The spelling of 2002140324073 in words is "two trillion, two billion, one hundred forty million, three hundred twenty-four thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •