Base | Representation |
---|---|
bin | 10111100100110000… |
… | …01000010000100000 |
3 | 1012200001010222222220 |
4 | 23302120020100200 |
5 | 201410011034034 |
6 | 5451513231040 |
7 | 625431111231 |
oct | 136230102040 |
9 | 35601128886 |
10 | 12656346144 |
11 | 54051a5202 |
12 | 2552702480 |
13 | 126912b220 |
14 | 880c71088 |
15 | 4e11bd749 |
hex | 2f2608420 |
12656346144 has 96 divisors (see below), whose sum is σ = 35807083200. Its totient is φ = 3891151872.
The previous prime is 12656346089. The next prime is 12656346169. The reversal of 12656346144 is 44164365621.
It is a tau number, because it is divible by the number of its divisors (96).
It is a junction number, because it is equal to n+sod(n) for n = 12656346096 and 12656346105.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1929879 + ... + 1936425.
It is an arithmetic number, because the mean of its divisors is an integer number (372990450).
Almost surely, 212656346144 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12656346144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17903541600).
12656346144 is an abundant number, since it is smaller than the sum of its proper divisors (23150737056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12656346144 is a wasteful number, since it uses less digits than its factorization.
12656346144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8122 (or 8114 counting only the distinct ones).
The product of its digits is 414720, while the sum is 42.
The spelling of 12656346144 in words is "twelve billion, six hundred fifty-six million, three hundred forty-six thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •