Base | Representation |
---|---|
bin | 1111010111010… |
… | …01100010100001 |
3 | 22222111221000212 |
4 | 13223221202201 |
5 | 230443222344 |
6 | 20442223505 |
7 | 3123325514 |
oct | 753514241 |
9 | 288457025 |
10 | 128882849 |
11 | 66829657 |
12 | 371b4b95 |
13 | 20917154 |
14 | 1318cd7b |
15 | b4ac79e |
hex | 7ae98a1 |
128882849 has 2 divisors, whose sum is σ = 128882850. Its totient is φ = 128882848.
The previous prime is 128882839. The next prime is 128882851. The reversal of 128882849 is 948288821.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 76247824 + 52635025 = 8732^2 + 7255^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-128882849 is a prime.
It is a super-2 number, since 2×1288828492 = 33221577532713602, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 128882851, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 128882797 and 128882806.
It is not a weakly prime, because it can be changed into another prime (128882839) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 64441424 + 64441425.
It is an arithmetic number, because the mean of its divisors is an integer number (64441425).
Almost surely, 2128882849 is an apocalyptic number.
It is an amenable number.
128882849 is a deficient number, since it is larger than the sum of its proper divisors (1).
128882849 is an equidigital number, since it uses as much as digits as its factorization.
128882849 is an evil number, because the sum of its binary digits is even.
The product of its digits is 589824, while the sum is 50.
The square root of 128882849 is about 11352.6582349686. The cubic root of 128882849 is about 505.1244329516.
The spelling of 128882849 in words is "one hundred twenty-eight million, eight hundred eighty-two thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •