Base | Representation |
---|---|
bin | 111110110011000… |
… | …111011011001101 |
3 | 2201102111202212021 |
4 | 332303013123031 |
5 | 4124204242044 |
6 | 252314010141 |
7 | 35052225436 |
oct | 7663073315 |
9 | 2642452767 |
10 | 1053587149 |
11 | 4a07a468a |
12 | 254a16951 |
13 | 13a380264 |
14 | 9dcda48d |
15 | 62768e84 |
hex | 3ecc76cd |
1053587149 has 2 divisors, whose sum is σ = 1053587150. Its totient is φ = 1053587148.
The previous prime is 1053587147. The next prime is 1053587153. The reversal of 1053587149 is 9417853501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 815502249 + 238084900 = 28557^2 + 15430^2 .
It is a cyclic number.
It is not a de Polignac number, because 1053587149 - 21 = 1053587147 is a prime.
It is a super-2 number, since 2×10535871492 = 2220091761075896402, which contains 22 as substring.
Together with 1053587147, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1053587141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526793574 + 526793575.
It is an arithmetic number, because the mean of its divisors is an integer number (526793575).
Almost surely, 21053587149 is an apocalyptic number.
It is an amenable number.
1053587149 is a deficient number, since it is larger than the sum of its proper divisors (1).
1053587149 is an equidigital number, since it uses as much as digits as its factorization.
1053587149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 151200, while the sum is 43.
The square root of 1053587149 is about 32459.0072090937. The cubic root of 1053587149 is about 1017.5524904956.
The spelling of 1053587149 in words is "one billion, fifty-three million, five hundred eighty-seven thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •