Base | Representation |
---|---|
bin | 10111100001110101… |
… | …11000111011110000 |
3 | 1012121100011012122201 |
4 | 23300322320323300 |
5 | 201332231411414 |
6 | 5445241312544 |
7 | 625013261260 |
oct | 136072707360 |
9 | 35540135581 |
10 | 12631903984 |
11 | 53a2420477 |
12 | 2546495754 |
13 | 1264050bcb |
14 | 87b90b7a0 |
15 | 4dde91574 |
hex | 2f0eb8ef0 |
12631903984 has 80 divisors (see below), whose sum is σ = 29098137600. Its totient is φ = 5197554432.
The previous prime is 12631903967. The next prime is 12631904017. The reversal of 12631903984 is 48930913621.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 570529 + ... + 592255.
It is an arithmetic number, because the mean of its divisors is an integer number (363726720).
Almost surely, 212631903984 is an apocalyptic number.
12631903984 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12631903984, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14549068800).
12631903984 is an abundant number, since it is smaller than the sum of its proper divisors (16466233616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12631903984 is a wasteful number, since it uses less digits than its factorization.
12631903984 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21950 (or 21944 counting only the distinct ones).
The product of its (nonzero) digits is 279936, while the sum is 46.
The spelling of 12631903984 in words is "twelve billion, six hundred thirty-one million, nine hundred three thousand, nine hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.058 sec. • engine limits •