Base | Representation |
---|---|
bin | 10111101000101101… |
… | …01011100001101000 |
3 | 1012202100120102222210 |
4 | 23310112223201220 |
5 | 201442004130434 |
6 | 5455100245120 |
7 | 626313101205 |
oct | 136426534150 |
9 | 35670512883 |
10 | 12689520744 |
11 | 54219a382a |
12 | 25618407a0 |
13 | 1272c75174 |
14 | 885428cac |
15 | 4e4072ee9 |
hex | 2f45ab868 |
12689520744 has 32 divisors (see below), whose sum is σ = 32197295520. Its totient is φ = 4166707776.
The previous prime is 12689520721. The next prime is 12689520751. The reversal of 12689520744 is 44702598621.
12689520744 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×126895207443 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 12689520693 and 12689520702.
It is an unprimeable number.
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, 3944139 + ... + 3947354.
It is an arithmetic number, because the mean of its divisors is an integer number (1006165485).
Almost surely, 212689520744 is an apocalyptic number.
It is an amenable number.
12689520744 is an abundant number, since it is smaller than the sum of its proper divisors (19507774776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12689520744 is a wasteful number, since it uses less digits than its factorization.
12689520744 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7891569 (or 7891565 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 48.
The spelling of 12689520744 in words is "twelve billion, six hundred eighty-nine million, five hundred twenty thousand, seven hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •