Base | Representation |
---|---|
bin | 100110011001101010010… |
… | …000011001000000101101 |
3 | 100100021102221222202122102 |
4 | 212121222100121000231 |
5 | 321213423001221024 |
6 | 5340142430424445 |
7 | 361440135004352 |
oct | 46315220310055 |
9 | 10307387882572 |
10 | 2638892601389 |
11 | 92816a094460 |
12 | 367527962125 |
13 | 161b00a02985 |
14 | 91a1a1d8629 |
15 | 4899c4d91ae |
hex | 2666a41902d |
2638892601389 has 8 divisors (see below), whose sum is σ = 2925985239840. Its totient is φ = 2359665514800.
The previous prime is 2638892601349. The next prime is 2638892601467. The reversal of 2638892601389 is 9831062988362.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-2638892601389 is a prime.
It is a super-3 number, since 3×26388926013893 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2638892601349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1966387259 + ... + 1966388600.
It is an arithmetic number, because the mean of its divisors is an integer number (365748154980).
Almost surely, 22638892601389 is an apocalyptic number.
It is an amenable number.
2638892601389 is a deficient number, since it is larger than the sum of its proper divisors (287092638451).
2638892601389 is a wasteful number, since it uses less digits than its factorization.
2638892601389 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3932775931.
The product of its (nonzero) digits is 53747712, while the sum is 65.
The spelling of 2638892601389 in words is "two trillion, six hundred thirty-eight billion, eight hundred ninety-two million, six hundred one thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •