Base | Representation |
---|---|
bin | 10111001110101100… |
… | …01010000100101000 |
3 | 1012012010220122212000 |
4 | 23213112022010220 |
5 | 201020121424122 |
6 | 5421302451000 |
7 | 621023062440 |
oct | 134726120450 |
9 | 35163818760 |
10 | 12471279912 |
11 | 531a792203 |
12 | 2500733a60 |
13 | 12399a2390 |
14 | 864459120 |
15 | 4ced140ac |
hex | 2e758a128 |
12471279912 has 512 divisors, whose sum is σ = 44676710400. Its totient is φ = 3135283200.
The previous prime is 12471279911. The next prime is 12471279929. The reversal of 12471279912 is 21997217421.
It is a happy number.
It is a nude number because it is divisible by every one of its digits.
It is not an unprimeable number, because it can be changed into a prime (12471279911) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 59105487 + ... + 59105697.
It is an arithmetic number, because the mean of its divisors is an integer number (87259200).
Almost surely, 212471279912 is an apocalyptic number.
12471279912 is a gapful number since it is divisible by the number (12) 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 12471279912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22338355200).
12471279912 is an abundant number, since it is smaller than the sum of its proper divisors (32205430488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12471279912 is a wasteful number, since it uses less digits than its factorization.
12471279912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374 (or 364 counting only the distinct ones).
The product of its digits is 127008, while the sum is 45.
The spelling of 12471279912 in words is "twelve billion, four hundred seventy-one million, two hundred seventy-nine thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •