Base | Representation |
---|---|
bin | 11110000010001111010… |
… | …111100111001011001101 |
3 | 21022022111222122001022221 |
4 | 132002033113213023031 |
5 | 232304022321234431 |
6 | 4220103404535341 |
7 | 302055405263020 |
oct | 36021727471315 |
9 | 7268458561287 |
10 | 2063989633741 |
11 | 726373381812 |
12 | 294021b51551 |
13 | 11c830723789 |
14 | 71c7d1591b7 |
15 | 38a50b09111 |
hex | 1e08f5e72cd |
2063989633741 has 8 divisors (see below), whose sum is σ = 2358871859840. Its totient is φ = 1769114048688.
The previous prime is 2063989633709. The next prime is 2063989633787. The reversal of 2063989633741 is 1473369893602.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2063989633741 - 25 = 2063989633709 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2063989633741.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2063989633141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 975441 + ... + 2253766.
It is an arithmetic number, because the mean of its divisors is an integer number (294858982480).
Almost surely, 22063989633741 is an apocalyptic number.
It is an amenable number.
2063989633741 is a deficient number, since it is larger than the sum of its proper divisors (294882226099).
2063989633741 is an equidigital number, since it uses as much as digits as its factorization.
2063989633741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3320523.
The product of its (nonzero) digits is 35271936, while the sum is 61.
The spelling of 2063989633741 in words is "two trillion, sixty-three billion, nine hundred eighty-nine million, six hundred thirty-three thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •