Base | Representation |
---|---|
bin | 10111011011000110… |
… | …01001000010001100 |
3 | 1012110101201210211020 |
4 | 23231203021002030 |
5 | 201223242044303 |
6 | 5435501154140 |
7 | 623425453512 |
oct | 135543110214 |
9 | 35411653736 |
10 | 12575346828 |
11 | 5373501220 |
12 | 252b55b950 |
13 | 125540b035 |
14 | 8741c84b2 |
15 | 4d901da53 |
hex | 2ed8c908c |
12575346828 has 96 divisors (see below), whose sum is σ = 34016951808. Its totient is φ = 3573427200.
The previous prime is 12575346803. The next prime is 12575346829. The reversal of 12575346828 is 82864357521.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (12575346829) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 611473 + ... + 631703.
It is an arithmetic number, because the mean of its divisors is an integer number (354343248).
Almost surely, 212575346828 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 12575346828, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17008475904).
12575346828 is an abundant number, since it is smaller than the sum of its proper divisors (21441604980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12575346828 is a wasteful number, since it uses less digits than its factorization.
12575346828 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20543 (or 20541 counting only the distinct ones).
The product of its digits is 3225600, while the sum is 51.
It can be divided in two parts, 1257 and 5346828, that added together give a triangular number (5348085 = T3270).
The spelling of 12575346828 in words is "twelve billion, five hundred seventy-five million, three hundred forty-six thousand, eight hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •