Base | Representation |
---|---|
bin | 11110001010111111110… |
… | …101001110111111111111 |
3 | 21100012210022001020222222 |
4 | 132022333311032333333 |
5 | 232432302003434444 |
6 | 4224300423555555 |
7 | 302540413436312 |
oct | 36127765167777 |
9 | 7305708036888 |
10 | 2073392639999 |
11 | 72a35910156a |
12 | 295a06bbbbbb |
13 | 12069b8287c5 |
14 | 724d1cb8979 |
15 | 38e0138eeee |
hex | 1e2bfd4efff |
2073392639999 has 8 divisors (see below), whose sum is σ = 2257777830000. Its totient is φ = 1896533376192.
The previous prime is 2073392639971. The next prime is 2073392640043. The reversal of 2073392639999 is 9999362933702.
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 2073392639999 - 212 = 2073392635903 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 (2073392639099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1881480974 + ... + 1881482075.
It is an arithmetic number, because the mean of its divisors is an integer number (282222228750).
Almost surely, 22073392639999 is an apocalyptic number.
2073392639999 is a gapful number since it is divisible by the number (29) formed by its first and last digit.
2073392639999 is a deficient number, since it is larger than the sum of its proper divisors (184385190001).
2073392639999 is a wasteful number, since it uses less digits than its factorization.
2073392639999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3762963097.
The product of its (nonzero) digits is 267846264, while the sum is 71.
The spelling of 2073392639999 in words is "two trillion, seventy-three billion, three hundred ninety-two million, six hundred thirty-nine thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •