Base | Representation |
---|---|
bin | 10110110101001001… |
… | …10110100001010000 |
3 | 1011122012202112201112 |
4 | 23122210312201100 |
5 | 200100244400201 |
6 | 5344130352452 |
7 | 612512010011 |
oct | 133244664120 |
9 | 34565675645 |
10 | 12257028176 |
11 | 521a855758 |
12 | 2460a2b728 |
13 | 12044981c3 |
14 | 843c07008 |
15 | 4bb0e20bb |
hex | 2da936850 |
12257028176 has 40 divisors (see below), whose sum is σ = 24607535880. Its totient is φ = 5907396096.
The previous prime is 12257028167. The next prime is 12257028197. The reversal of 12257028176 is 67182075221.
It can be written as a sum of positive squares in 4 ways, for example, as 41473600 + 12215554576 = 6440^2 + 110524^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 262886 + ... + 305978.
It is an arithmetic number, because the mean of its divisors is an integer number (615188397).
Almost surely, 212257028176 is an apocalyptic number.
12257028176 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 12257028176, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12303767940).
12257028176 is an abundant number, since it is smaller than the sum of its proper divisors (12350507704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12257028176 is a wasteful number, since it uses less digits than its factorization.
12257028176 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43743 (or 43737 counting only the distinct ones).
The product of its (nonzero) digits is 94080, while the sum is 41.
The spelling of 12257028176 in words is "twelve billion, two hundred fifty-seven million, twenty-eight thousand, one hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •