Base | Representation |
---|---|
bin | 1111010010011… |
… | …00111001110101 |
3 | 22221022022221122 |
4 | 13221030321311 |
5 | 230312210034 |
6 | 20420353325 |
7 | 3115014152 |
oct | 751147165 |
9 | 287268848 |
10 | 128241269 |
11 | 66430622 |
12 | 36b45845 |
13 | 20751110 |
14 | 13063229 |
15 | b3d262e |
hex | 7a4ce75 |
128241269 has 4 divisors (see below), whose sum is σ = 138105996. Its totient is φ = 118376544.
The previous prime is 128241263. The next prime is 128241293. The reversal of 128241269 is 962142821.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 962142821 = 467 ⋅2060263.
It can be written as a sum of positive squares in 2 ways, for example, as 13965169 + 114276100 = 3737^2 + 10690^2 .
It is a de Polignac number, because none of the positive numbers 2k-128241269 is a prime.
It is a super-2 number, since 2×1282412692 = 32891646149460722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (128241263) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4932344 + ... + 4932369.
It is an arithmetic number, because the mean of its divisors is an integer number (34526499).
Almost surely, 2128241269 is an apocalyptic number.
It is an amenable number.
128241269 is a deficient number, since it is larger than the sum of its proper divisors (9864727).
128241269 is an equidigital number, since it uses as much as digits as its factorization.
128241269 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9864726.
The product of its digits is 13824, while the sum is 35.
The square root of 128241269 is about 11324.3661632782. The cubic root of 128241269 is about 504.2848669366.
The spelling of 128241269 in words is "one hundred twenty-eight million, two hundred forty-one thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •