Base | Representation |
---|---|
bin | 100110100110100111100 |
3 | 2101021012020 |
4 | 10310310330 |
5 | 310434311 |
6 | 43040140 |
7 | 13515630 |
oct | 4646474 |
9 | 2337166 |
10 | 1264956 |
11 | 794420 |
12 | 510050 |
13 | 3539c4 |
14 | 24cdc0 |
15 | 19ec06 |
hex | 134d3c |
1264956 has 72 divisors (see below), whose sum is σ = 3782016. Its totient is φ = 319680.
The previous prime is 1264933. The next prime is 1264969. The reversal of 1264956 is 6594621.
It is a super-2 number, since 2×12649562 = 3200227363872, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
Its product of digits (12960) is a multiple of the sum of its prime divisors (60).
It is a congruent number.
It is an unprimeable number.
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 in 23 ways as a sum of consecutive naturals, for example, 34170 + ... + 34206.
It is an arithmetic number, because the mean of its divisors is an integer number (52528).
21264956 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1264956, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1891008).
1264956 is an abundant number, since it is smaller than the sum of its proper divisors (2517060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1264956 is a wasteful number, since it uses less digits than its factorization.
1264956 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99 (or 60 counting only the distinct ones).
The product of its digits is 12960, while the sum is 33.
The square root of 1264956 is about 1124.7026273642. The cubic root of 1264956 is about 108.1496553529.
The spelling of 1264956 in words is "one million, two hundred sixty-four thousand, nine hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •