Base | Representation |
---|---|
bin | 111011101010011100… |
… | …1101011000110110001 |
3 | 110020201022120010210120 |
4 | 1313110321223012301 |
5 | 4044400220041040 |
6 | 134505451320453 |
7 | 12154036344000 |
oct | 1672471530661 |
9 | 406638503716 |
10 | 128125940145 |
11 | 4a379831235 |
12 | 209b9150129 |
13 | c10b854088 |
14 | 62b6634c37 |
15 | 34ed57b7d0 |
hex | 1dd4e6b1b1 |
128125940145 has 128 divisors (see below), whose sum is σ = 245130624000. Its totient is φ = 57105506304.
The previous prime is 128125940141. The next prime is 128125940149. The reversal of 128125940145 is 541049521821.
It is an interprime number because it is at equal distance from previous prime (128125940141) and next prime (128125940149).
It is not a de Polignac number, because 128125940145 - 22 = 128125940141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 128125940097 and 128125940106.
It is not an unprimeable number, because it can be changed into a prime (128125940141) 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, 33425149 + ... + 33428981.
It is an arithmetic number, because the mean of its divisors is an integer number (1915083000).
Almost surely, 2128125940145 is an apocalyptic number.
128125940145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
128125940145 is a deficient number, since it is larger than the sum of its proper divisors (117004683855).
128125940145 is an equidigital number, since it uses as much as digits as its factorization.
128125940145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4024 (or 4010 counting only the distinct ones).
The product of its (nonzero) digits is 115200, while the sum is 42.
The spelling of 128125940145 in words is "one hundred twenty-eight billion, one hundred twenty-five million, nine hundred forty thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •