Base | Representation |
---|---|
bin | 100000001001001001101 |
3 | 1222111210200 |
4 | 10001021031 |
5 | 232201021 |
6 | 34324113 |
7 | 11644506 |
oct | 4011115 |
9 | 1874720 |
10 | 1053261 |
11 | 65a370 |
12 | 429639 |
13 | 2ab541 |
14 | 1d5bad |
15 | 15c126 |
hex | 10124d |
1053261 has 12 divisors (see below), whose sum is σ = 1659840. Its totient is φ = 638280.
The previous prime is 1053259. The next prime is 1053263. The reversal of 1053261 is 1623501.
It is an interprime number because it is at equal distance from previous prime (1053259) and next prime (1053263).
It is not a de Polignac number, because 1053261 - 21 = 1053259 is a prime.
It is a super-2 number, since 2×10532612 = 2218717468242, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1053263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5221 + ... + 5418.
It is an arithmetic number, because the mean of its divisors is an integer number (138320).
21053261 is an apocalyptic number.
1053261 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1053261 is a deficient number, since it is larger than the sum of its proper divisors (606579).
1053261 is a wasteful number, since it uses less digits than its factorization.
1053261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10656 (or 10653 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 1053261 is about 1026.2850481226. The cubic root of 1053261 is about 101.7447481629.
Adding to 1053261 its reverse (1623501), we get a palindrome (2676762).
The spelling of 1053261 in words is "one million, fifty-three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •