Base | Representation |
---|---|
bin | 1011100000011011001100… |
… | …0111100011001111111000 |
3 | 1122210111012121002121111110 |
4 | 2320012303013203033320 |
5 | 3124241122022202033 |
6 | 42524034151200320 |
7 | 2444024342553354 |
oct | 270066307431770 |
9 | 48714177077443 |
10 | 12651683787768 |
11 | 4038604740093 |
12 | 1503b933760a0 |
13 | 70a082bab01c |
14 | 31a4b8058464 |
15 | 16e175383363 |
hex | b81b31e33f8 |
12651683787768 has 64 divisors (see below), whose sum is σ = 31952225157120. Its totient is φ = 4174313270400.
The previous prime is 12651683787761. The next prime is 12651683787803. The reversal of 12651683787768 is 86778738615621.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 12651683787768.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12651683787761) 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 15 ways as a sum of consecutive naturals, for example, 3501643 + ... + 6129018.
It is an arithmetic number, because the mean of its divisors is an integer number (499253518080).
Almost surely, 212651683787768 is an apocalyptic number.
It is an amenable number.
12651683787768 is an abundant number, since it is smaller than the sum of its proper divisors (19300541369352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12651683787768 is a wasteful number, since it uses less digits than its factorization.
12651683787768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9631228 (or 9631224 counting only the distinct ones).
The product of its digits is 1137991680, while the sum is 75.
The spelling of 12651683787768 in words is "twelve trillion, six hundred fifty-one billion, six hundred eighty-three million, seven hundred eighty-seven thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •