Base | Representation |
---|---|
bin | 10111100011000111… |
… | …10001011001100000 |
3 | 1012122002022200200010 |
4 | 23301203301121200 |
5 | 201343002333044 |
6 | 5450303124520 |
7 | 625203335265 |
oct | 136143613140 |
9 | 35562280603 |
10 | 12642621024 |
11 | 53a8480330 |
12 | 2549ba3740 |
13 | 1266333c57 |
14 | 87d0db26c |
15 | 4dedabbb9 |
hex | 2f18f1660 |
12642621024 has 96 divisors (see below), whose sum is σ = 36226237824. Its totient is φ = 3828730880.
The previous prime is 12642621023. The next prime is 12642621037. The reversal of 12642621024 is 42012624621.
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 = 12642620982 and 12642621000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12642621023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2524507 + ... + 2529509.
It is an arithmetic number, because the mean of its divisors is an integer number (377356644).
Almost surely, 212642621024 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 12642621024, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18113118912).
12642621024 is an abundant number, since it is smaller than the sum of its proper divisors (23583616800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12642621024 is a wasteful number, since it uses less digits than its factorization.
12642621024 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7420 (or 7412 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 30.
The spelling of 12642621024 in words is "twelve billion, six hundred forty-two million, six hundred twenty-one thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •