Base | Representation |
---|---|
bin | 100001101000110… |
… | …1000101010000001 |
3 | 2220122211201110012 |
4 | 1003101220222001 |
5 | 4302421241244 |
6 | 303555514305 |
7 | 36653522126 |
oct | 10321505201 |
9 | 2818751405 |
10 | 1128696449 |
11 | 52a135391 |
12 | 275bb8995 |
13 | 14caba52a |
14 | a9c8c74d |
15 | 6915389e |
hex | 43468a81 |
1128696449 has 2 divisors, whose sum is σ = 1128696450. Its totient is φ = 1128696448.
The previous prime is 1128696407. The next prime is 1128696451. The reversal of 1128696449 is 9446968211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 753886849 + 374809600 = 27457^2 + 19360^2 .
It is a cyclic number.
It is not a de Polignac number, because 1128696449 - 28 = 1128696193 is a prime.
Together with 1128696451, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1128696397 and 1128696406.
It is not a weakly prime, because it can be changed into another prime (1128696479) 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 as a sum of consecutive naturals, namely, 564348224 + 564348225.
It is an arithmetic number, because the mean of its divisors is an integer number (564348225).
Almost surely, 21128696449 is an apocalyptic number.
It is an amenable number.
1128696449 is a deficient number, since it is larger than the sum of its proper divisors (1).
1128696449 is an equidigital number, since it uses as much as digits as its factorization.
1128696449 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 746496, while the sum is 50.
The square root of 1128696449 is about 33596.0778812051. The cubic root of 1128696449 is about 1041.1797660234.
The spelling of 1128696449 in words is "one billion, one hundred twenty-eight million, six hundred ninety-six thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •