Base | Representation |
---|---|
bin | 1111010000101… |
… | …10000100000101 |
3 | 22220212220211020 |
4 | 13220112010011 |
5 | 230233013040 |
6 | 20411501353 |
7 | 3113060241 |
oct | 750260405 |
9 | 286786736 |
10 | 128016645 |
11 | 66297889 |
12 | 36a57859 |
13 | 206a2ac3 |
14 | 13005421 |
15 | b38acd0 |
hex | 7a16105 |
128016645 has 8 divisors (see below), whose sum is σ = 204826656. Its totient is φ = 68275536.
The previous prime is 128016641. The next prime is 128016653. The reversal of 128016645 is 546610821.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 128016645 - 22 = 128016641 is a prime.
It is a super-2 number, since 2×1280166452 = 32776522794112050, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (128016641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4267207 + ... + 4267236.
It is an arithmetic number, because the mean of its divisors is an integer number (25603332).
Almost surely, 2128016645 is an apocalyptic number.
128016645 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
128016645 is a deficient number, since it is larger than the sum of its proper divisors (76810011).
128016645 is an equidigital number, since it uses as much as digits as its factorization.
128016645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8534451.
The product of its (nonzero) digits is 11520, while the sum is 33.
The square root of 128016645 is about 11314.4440870950. Note that the first 3 decimals coincide. The cubic root of 128016645 is about 503.9902642047.
The spelling of 128016645 in words is "one hundred twenty-eight million, sixteen thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •