Base | Representation |
---|---|
bin | 10110110100010011… |
… | …10110000110100000 |
3 | 1011121201102212100010 |
4 | 23122021312012200 |
5 | 200041441323301 |
6 | 5343314524520 |
7 | 612364562535 |
oct | 133211660640 |
9 | 34551385303 |
10 | 12249948576 |
11 | 521685a748 |
12 | 245a596740 |
13 | 1202b899a8 |
14 | 842cc2d8c |
15 | 4ba6945d6 |
hex | 2da2761a0 |
12249948576 has 96 divisors (see below), whose sum is σ = 32546562048. Its totient is φ = 4034016000.
The previous prime is 12249948559. The next prime is 12249948583. The reversal of 12249948576 is 67584994221.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-2 number, since 2×122499485762 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3058191 + ... + 3062193.
It is an arithmetic number, because the mean of its divisors is an integer number (339026688).
Almost surely, 212249948576 is an apocalyptic number.
12249948576 is a gapful number since it is divisible by the number (16) 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 12249948576, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16273281024).
12249948576 is an abundant number, since it is smaller than the sum of its proper divisors (20296613472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12249948576 is a wasteful number, since it uses less digits than its factorization.
12249948576 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4394 (or 4386 counting only the distinct ones).
The product of its digits is 8709120, while the sum is 57.
The spelling of 12249948576 in words is "twelve billion, two hundred forty-nine million, nine hundred forty-eight thousand, five hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •