Base | Representation |
---|---|
bin | 1111010100111… |
… | …00111010110101 |
3 | 22221220222112022 |
4 | 13222130322311 |
5 | 230403202023 |
6 | 20431402525 |
7 | 3120550526 |
oct | 752347265 |
9 | 287828468 |
10 | 128569013 |
11 | 66634891 |
12 | 37083445 |
13 | 20837351 |
14 | 1310a84d |
15 | b4497c8 |
hex | 7a9ceb5 |
128569013 has 2 divisors, whose sum is σ = 128569014. Its totient is φ = 128569012.
The previous prime is 128568983. The next prime is 128569037. The reversal of 128569013 is 310965821.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 128550244 + 18769 = 11338^2 + 137^2 .
It is a cyclic number.
It is not a de Polignac number, because 128569013 - 216 = 128503477 is a prime.
It is a super-2 number, since 2×1285690132 = 33059982207588338, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (128569213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 64284506 + 64284507.
It is an arithmetic number, because the mean of its divisors is an integer number (64284507).
Almost surely, 2128569013 is an apocalyptic number.
It is an amenable number.
128569013 is a deficient number, since it is larger than the sum of its proper divisors (1).
128569013 is an equidigital number, since it uses as much as digits as its factorization.
128569013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 35.
The square root of 128569013 is about 11338.8276730886. The cubic root of 128569013 is about 504.7140988636.
The spelling of 128569013 in words is "one hundred twenty-eight million, five hundred sixty-nine thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •