Base | Representation |
---|---|
bin | 111011110001001110… |
… | …0110111010000001110 |
3 | 110021022011022122000112 |
4 | 1313202130313100032 |
5 | 4100331414100000 |
6 | 134544212000022 |
7 | 12162466532420 |
oct | 1674234672016 |
9 | 407264278015 |
10 | 128353268750 |
11 | 4a48608a613 |
12 | 20a61300012 |
13 | c146989445 |
14 | 62d88cc810 |
15 | 35134d3235 |
hex | 1de273740e |
128353268750 has 48 divisors (see below), whose sum is σ = 275025209760. Its totient is φ = 44006820000.
The previous prime is 128353268749. The next prime is 128353268753. The reversal of 128353268750 is 57862353821.
128353268750 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (50).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (128353268753) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1423145 + ... + 1510644.
It is an arithmetic number, because the mean of its divisors is an integer number (5729691870).
Almost surely, 2128353268750 is an apocalyptic number.
128353268750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
128353268750 is an abundant number, since it is smaller than the sum of its proper divisors (146671941010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
128353268750 is an frugal number, since it uses more digits than its factorization.
128353268750 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2933823 (or 2933803 counting only the distinct ones).
The product of its (nonzero) digits is 2419200, while the sum is 50.
The spelling of 128353268750 in words is "one hundred twenty-eight billion, three hundred fifty-three million, two hundred sixty-eight thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •