Base | Representation |
---|---|
bin | 100000000001010111010 |
3 | 1222022100000 |
4 | 10000022322 |
5 | 232034044 |
6 | 34253430 |
7 | 11630052 |
oct | 4001272 |
9 | 1868300 |
10 | 1049274 |
11 | 657376 |
12 | 427276 |
13 | 2a9795 |
14 | 1d4562 |
15 | 15ad69 |
hex | 1002ba |
1049274 has 48 divisors (see below), whose sum is σ = 2515968. Its totient is φ = 326592.
The previous prime is 1049263. The next prime is 1049281. The reversal of 1049274 is 4729401.
It is a happy number.
It is a super-2 number, since 2×10492742 = 2201951854152, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 8199 + ... + 8325.
It is an arithmetic number, because the mean of its divisors is an integer number (52416).
21049274 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1049274, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1257984).
1049274 is an abundant number, since it is smaller than the sum of its proper divisors (1466694).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1049274 is a wasteful number, since it uses less digits than its factorization.
1049274 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161 (or 149 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
The square root of 1049274 is about 1024.3407636134. The cubic root of 1049274 is about 101.6162047644.
It can be divided in two parts, 10 and 49274, that added together give a square (49284 = 2222).
The spelling of 1049274 in words is "one million, forty-nine thousand, two hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •