Base | Representation |
---|---|
bin | 1011010010011100111110… |
… | …0110111010111001011000 |
3 | 1121221112121210010212111220 |
4 | 2310213033212322321120 |
5 | 3111323021230321233 |
6 | 42221455205052040 |
7 | 2420466045635355 |
oct | 264471746727130 |
9 | 47845553125456 |
10 | 12411643604568 |
11 | 3a5582627569a |
12 | 14855623b7020 |
13 | 6c054a3aa570 |
14 | 30ca2630962c |
15 | 167cc6b3aeb3 |
hex | b49cf9bae58 |
12411643604568 has 128 divisors (see below), whose sum is σ = 34083794330880. Its totient is φ = 3743086256640.
The previous prime is 12411643604519. The next prime is 12411643604593. The reversal of 12411643604568 is 86540634611421.
It is a self number, because there is not a number n which added to its sum of digits gives 12411643604568.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4233855 + ... + 6538257.
It is an arithmetic number, because the mean of its divisors is an integer number (266279643210).
Almost surely, 212411643604568 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 12411643604568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17041897165440).
12411643604568 is an abundant number, since it is smaller than the sum of its proper divisors (21672150726312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12411643604568 is a wasteful number, since it uses less digits than its factorization.
12411643604568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2304769 (or 2304765 counting only the distinct ones).
The product of its (nonzero) digits is 3317760, while the sum is 51.
The spelling of 12411643604568 in words is "twelve trillion, four hundred eleven billion, six hundred forty-three million, six hundred four thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •